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

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

Tianrong Lin

Published Mar 1, 2012• 0 citations
OpenAlex

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

Multi-letter Reversible and Quantum Finite Automata

Aleksandrs Belovs, Ansis Rosmanis, Juris Smotrovs

Lecture notes in computer science•Sep 12, 2007•17 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

Determining the equivalence for one-way quantum finite automata

Lvzhou Li, Daowen Qiu

Theoretical Computer Science•Apr 2, 2008•50 citations