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

Quantum versus Probabilistic One-Way Finite Automata with Counter

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

Published Jan 1, 2001• 15 citations
Publisher
DOI
10.1007/3-540-45627-9_15

Related papers

One-way probabilistic reversible and quantum one-counter automata

Tomohiro Yamasaki, Hirotada Kobayashi, Yuuki Tokunaga +1 more

Theoretical Computer Science•Oct 1, 2002•22 citations

One-Way Probabilistic Reversible and Quantum One-Counter Automata

Tomohiro Yamasaki, Hirotada Kobayashi, Yuuki Tokunaga +1 more

Lecture notes in computer science•Jan 1, 2000•3 citations

The Complexity of Probabilistic versus Quantum Finite Automata

Gatis Midrijānis

arXiv:quant-ph/0309080•Lecture notes in computer science•Jan 1, 2002•0 citations

Quantum versus deterministic counter automata

Tomohiro Yamasaki, Hirotada Kobayashi, Hiroshi Imai

Theoretical Computer Science•Sep 8, 2004•21 citations

Quantum versus Deterministic Counter Automata

Tomohiro Yamasaki, Hirotada Kobayashi, Hiroshi Imai

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

Quantum Finite One-Counter Automata

Maksim Kravtsev

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