Various Aspects of Finite Quantum Automata

DOI10.1007/978-3-540-85780-8_2MaRDI QIDQ3532997zbMATH OpenOpenAlexFDO

Authors Mika Hirvensalo

Publication date 30 October 2008

Published in Developments in Language Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-85780-8_2

Mathematics Subject Classification ID

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

Cited in

(16)

• Quantum automata: an overview.
• Unbounded-error quantum computation with small space bounds
• Exponentially more concise quantum recognition of non-RMM regular languages
• On probabilistic and quantum reaction systems
• scientific article; zbMATH DE number 1948489 (Why is no real title available?)
• Reachability analysis of quantum Markov decision processes
• Relativizations of nonuniform quantum finite automata families
• Another approach to the equivalence of measure-many one-way quantum finite automata and its application
• Quantum pushdown automata with garbage tape
• Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata
• On hybrid models of quantum finite automata
• scientific article; zbMATH DE number 6440119 (Why is no real title available?)
• Lower Bounds for Generalized Quantum Finite Automata
• Interference as a computational resource: a tutorial
• Quantum automata theory -- a review
• Quantum \(\omega\)-automata over infinite words and their relationships

This page was built for publication: Various Aspects of Finite Quantum Automata

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