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:0812.0852 · Theoretical Computer Science

Hierarchy and equivalence of multi-letter quantum finite automata

Daowen Qiu, Sheng Yü

Published Apr 8, 2009• 30 citations
arXivHTMLPDF
DOI
10.1016/j.tcs.2009.03.040

Related papers

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

Multi-letter Reversible and Quantum Finite Automata

Aleksandrs Belovs, Ansis Rosmanis, Juris Smotrovs

Lecture notes in computer science•Sep 12, 2007•17 citations

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

Tianrong Lin

•Mar 1, 2012•0 citations

Determining the equivalence for one-way quantum finite automata

Lvzhou Li, Daowen Qiu

Theoretical Computer Science•Apr 2, 2008•50 citations

Revisiting the Power and Equivalence of One-Way Quantum Finite Automata

Lvzhou Li, Daowen Qiu

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

Polynomial-Time Algorithms for the Equivalence for One-Way Quantum Finite Automata

Takeshi Koshiba

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