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

arXiv:1106.2530 · Lecture notes in computer science

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

Marats Golovkins, Maksim Kravtsev, Vasilijs Kravcevs

Published Jan 1, 2011• 6 citations
arXivHTMLPDF
DOI
10.1007/978-3-642-22993-0_33

Related papers

Probabilistic Reversible Automata and Quantum Automata

Marats Golovkins, Maksim Kravtsev

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

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

Marats Golovkins, Maksim Kravtsev, Vasilijs Kravcevs

Theoretical Computer Science•Feb 18, 2009•3 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

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

Languages Recognizable by Quantum Finite Automata

Rūsiņš Freivalds

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

Quantum Automata and Languages of Finite Index

Andrea Benso, Flavio D’Alessandro, Paolo Papi

Lecture notes in computer science•Jan 1, 2024•2 citations