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

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

Takeshi Koshiba

Published Jan 1, 2001• 11 citations
Publisher
DOI
10.1007/3-540-45678-3_24

Related papers

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

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

A minimization algorithm of 1-way quantum finite automata

Olga Siedlecka-Lamch

Metody Informatyki Stosowanej•Jan 1, 2010•0 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