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

Acta Informatica

Multi-letter quantum finite automata: decidability of the equivalence and minimization of states

Daowen Qiu, Lvzhou Li, Xiangfu Zou, Paulo Mateus, Jozef Gruska

Published Aug 1, 2011• 21 citations
Publisher
DOI
10.1007/s00236-011-0139-6

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 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

Quantum Finite Automata and Linear Context-Free Languages: A Decidable Problem

Alberto Bertoni, Christian Choffrut, Flavio D’Alessandro

arXiv:1303.2967•Lecture notes in computer science•Jan 1, 2013•4 citations

Determining the equivalence for one-way quantum finite automata

Lvzhou Li, Daowen Qiu

Theoretical Computer Science•Apr 2, 2008•50 citations

A minimization algorithm of 1-way quantum finite automata

Olga Siedlecka-Lamch

Metody Informatyki Stosowanej•Jan 1, 2010•0 citations