Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Classical and Quantum Counter Automata on Promise Problems

Masaki Nakanishi, Abuzer Yakaryılmaz

Published Jan 1, 2015• 13 citations
Publisher
DOI
10.1007/978-3-319-22360-5_19

Related papers

Promise problems solved by quantum and classical finite automata

Shenggen Zheng, Lvzhou Li, Daowen Qiu +1 more

arXiv:1411.3870•Theoretical Computer Science•Jan 4, 2017•14 citations

Complexity of Promise Problems on Classical and Quantum Automata

Maria Paola Bianchi, Carlo Mereghetti, Beatrice Palano

Lecture notes in computer science•Jan 1, 2014•22 citations

Unary Probabilistic and Quantum Automata on Promise Problems

Aida Gainutdinova, Abuzer Yakaryılmaz

Lecture notes in computer science•Jan 1, 2015•16 citations

Quantum versus deterministic counter automata

Tomohiro Yamasaki, Hirotada Kobayashi, Hiroshi Imai

Theoretical Computer Science•Sep 8, 2004•24 citations

Unary probabilistic and quantum automata on promise problems

Aida Gainutdinova, Abuzer Yakaryılmaz

Quantum Information Processing•Dec 26, 2017•22 citations

Quantum versus Deterministic Counter Automata

Tomohiro Yamasaki, Hirotada Kobayashi, Hiroshi Imai

Lecture notes in computer science•Jan 1, 2002•4 citations