Languages Recognized with Unbounded Error by Quantum Finite Automata

DOI10.1007/978-3-642-03351-3_33zbMath1248.68315OpenAlexW1597440471MaRDI QIDQ3392970

A. C. Cem Say, Abuzer Yakaryılmaz

Publication date: 18 August 2009

Published in: Computer Science - Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03351-3_33

Mathematics Subject Classification ID

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

Related Items (12)

Simulation methods for quantum walks on graphs applied to formal language recognition ⋮ Affine automata verifiers ⋮ Language recognition power and succinctness of affine automata ⋮ Another approach to the equivalence of measure-many one-way quantum finite automata and its application ⋮ A new family of nonstochastic languages ⋮ Exponentially more concise quantum recognition of non-RMM regular languages ⋮ More on quantum, stochastic, and pseudo stochastic languages with few states ⋮ Affine Computation and Affine Automaton ⋮ Unbounded-error quantum computation with small space bounds ⋮ Language Recognition Power and Succinctness of Affine Automata ⋮ Characterizations of one-way general quantum finite automata ⋮ Multi-letter quantum finite automata: decidability of the equivalence and minimization of states

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient probability amplification in two-way quantum finite automata
• Quantum automata and quantum grammars
• Two-way finite automata with quantum and classical states.
• Space-bounded quantum complexity
• Algebraic results on quantum automata
• Determining the equivalence for one-way quantum finite automata
• Undecidability on quantum finite automata
• Characterizations of 1-Way Quantum Finite Automata
• Quantum Computability
• Quantum Complexity Theory
• Probabilistic automata
• Generalized Automata and Stochastic Languages
• A context-free language which is not acceptable by a probabilistic automaton
• Fundamentals of Computation Theory
• Analogies and differences between quantum and stochastic automata

This page was built for publication: Languages Recognized with Unbounded Error by Quantum Finite Automata