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

Multi-letter Reversible and Quantum Finite Automata

Aleksandrs Belovs, Ansis Rosmanis, Juris Smotrovs

Published Sep 12, 2007• 17 citations
Publisher
DOI
10.1007/978-3-540-73208-2_9

Related papers

Hierarchy and equivalence of multi-letter quantum finite automata

Daowen Qiu, Sheng Yü

arXiv:0812.0852•Theoretical Computer Science•Apr 8, 2009•30 citations

Multi-letter quantum finite automata: decidability of the equivalence and minimization of states

Daowen Qiu, Lvzhou Li, Xiangfu Zou +2 more

Acta Informatica•Aug 1, 2011•21 citations

One-Way Reversible and Quantum Finite Automata with Advice

Tomoyuki Yamakami

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

One-way reversible and quantum finite automata with advice

Tomoyuki Yamakami

arXiv:1208.6092•Information and Computation•Oct 16, 2014•17 citations

Probabilistic Reversible Automata and Quantum Automata

Marats Golovkins, Maksim Kravtsev

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

On equivalence of multi-letter and multi-letter measure-many quantum finite automata

Tianrong Lin

•Mar 1, 2012•0 citations