scientific article; zbMATH DE number 2080997

MaRDI QIDQ4474095zbMATH OpenFDO

Authors Takeshi Koshiba

Publication date 4 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2223/22230268.htm

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Quantum computation (81P68)

Recommendations

• Determining the equivalence for one-way quantum finite automata
• Another approach to the equivalence of measure-many one-way quantum finite automata and its application
• A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata
• Equivalence checking of quantum finite-state machines
• scientific article; zbMATH DE number 1839434

Cited in

(8)

• Corrigendum to: ``Another approach to the equivalence of measure-many one-way quantum finite automata and its application
• Another approach to the equivalence of measure-many one-way quantum finite automata and its application
• A note on quantum sequential machines
• Determining the equivalence for one-way quantum finite automata
• Equivalence checking of quantum finite-state machines
• Quantum Büchi automata
• A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata
• Multi-letter quantum finite automata: decidability of the equivalence and minimization of states

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4474095)