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

Determining the equivalence for one-way quantum finite automata

Lvzhou Li, Daowen Qiu

Published Apr 2, 2008• 50 citations
Publisher
DOI
10.1016/j.tcs.2008.03.021

Related papers

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

Another approach to the equivalence of measure-many one-way quantum finite automata and its application

Tianrong Lin

arXiv:1106.2481•Journal of Computer and System Sciences•Jan 24, 2012•6 citations

Another approach of the equivalence problem for measure-many one-way quantum finite automata

Tianrong Lin

•Jun 13, 2011•0 citations

Characterizations of one-way general quantum finite automata

Lvzhou Li, Daowen Qiu, Xiangfu Zou +3 more

arXiv:0911.3266•Theoretical Computer Science•Nov 1, 2011•37 citations

One-Way Finite Automata with Quantum and Classical States

Shenggen Zheng, Daowen Qiu, Lvzhou Li +1 more

arXiv:1112.2022•Lecture notes in computer science•Jan 1, 2012•33 citations