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.2481 · Journal of Computer and System Sciences

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

Tianrong Lin

Published Jan 24, 2012• 6 citations
arXivHTMLPDF
DOI
10.1016/j.jcss.2012.01.004

Related papers

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

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

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

Tianrong Lin

•Mar 1, 2012•0 citations

Some algebraic properties of measure-once two-way quantum finite automata

Zhengjun Xi, Xin Wang, Yongming Li

Quantum Information Processing•Sep 15, 2008•0 citations