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

Theoretical Computer Science

Quantum versus deterministic counter automata

Tomohiro Yamasaki, Hirotada Kobayashi, Hiroshi Imai

Published Sep 8, 2004• 24 citations
Publisher
DOI
10.1016/j.tcs.2004.07.034

Related papers

Quantum versus Deterministic Counter Automata

Tomohiro Yamasaki, Hirotada Kobayashi, Hiroshi Imai

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

Quantum versus Probabilistic One-Way Finite Automata with Counter

Richard Bonner, Rūsiņš Freivalds, Maksim Kravtsev

Lecture notes in computer science•Jan 1, 2001•15 citations

Quantum Finite One-Counter Automata

Maksim Kravtsev

arXiv:quant-ph/9905092•Lecture notes in computer science•Jan 1, 1999•27 citations

Classical and Quantum Counter Automata on Promise Problems

Masaki Nakanishi, Abuzer Yakaryılmaz

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

Size of Quantum Versus Deterministic Finite Automata.

Andris Ambainis, Uldis Barbans, Agnese Belousova +7 more

IEEE Transactions on Very Large Scale Integration (VLSI) Systems•Jan 1, 2003•1 citation

One-way probabilistic reversible and quantum one-counter automata

Tomohiro Yamasaki, Hirotada Kobayashi, Yuuki Tokunaga +1 more

Theoretical Computer Science•Oct 1, 2002•23 citations