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

On a class of languages recognizable by probabilistic reversible decide-and-halt automata

Marats Golovkins, Maksim Kravtsev, Vasilijs Kravcevs

Published Feb 18, 2009• 3 citations
Publisher
DOI
10.1016/j.tcs.2009.01.042

Related papers

On the Class of Languages Recognizable by 1-Way Quantum Finite Automata

Andris Ambainis, Arnolds Ķikusts, Māris Valdats

Springer eBooks•Jun 12, 2007•46 citations

Quantum Finite Automata and Probabilistic Reversible Automata: R-trivial Idempotent Languages

Marats Golovkins, Maksim Kravtsev, Vasilijs Kravcevs

arXiv:1106.2530•Lecture notes in computer science•Jan 1, 2011•6 citations

Languages Recognizable by Quantum Finite Automata

Rūsiņš Freivalds

Lecture notes in computer science•Jan 1, 2006•5 citations

Probabilistic Reversible Automata and Quantum Automata

Marats Golovkins, Maksim Kravtsev

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

Quantum Finite Automata and Linear Context-Free Languages: A Decidable Problem

Alberto Bertoni, Christian Choffrut, Flavio D’Alessandro

arXiv:1303.2967•Lecture notes in computer science•Jan 1, 2013•4 citations

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