Languages recognized by nondeterministic quantum finite automata
zbMATH Open1236.81071MaRDI QIDQ3171611FDOQ3171611
Authors: Abuzer Yakaryılmaz, A. C. Cem Say 
Publication date: 5 October 2011
Recommendations
probabilistic automatanondeterministic quantum finite automataone-sided unbounded errorsublogarithmic space complexitytwo-sided unbounded error
Formal languages and automata (68Q45) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Error bounds for numerical methods for ordinary differential equations (65L70) Cellular automata (computational aspects) (68Q80)
Cited In (30)
- State succinctness of two-way finite automata with quantum and classical states
- Title not available (Why is that?)
- Unbounded-error quantum computation with small space bounds
- Exponentially more concise quantum recognition of non-RMM regular languages
- Implementation and Application of Automata
- Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice
- Uncountable classical and quantum complexity classes
- STACS 2004
- Affine computation and affine automaton
- Title not available (Why is that?)
- Title not available (Why is that?)
- More on quantum, stochastic, and pseudo stochastic languages with few states
- Very narrow quantum OBDDs and width hierarchies for classical OBDDs
- Quantum alternation
- Unary probabilistic and quantum automata on promise problems
- Quantum computation with devices whose contents are never read
- The complexity of probabilistic versus quantum finite automata
- Nondeterministic unitary OBDDs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Language recognition power and succinctness of affine automata
- Looking for Pairs that Hard to Separate: A Quantum Approach
- On a conjecture by Christian Choffrut
- Computational limitations of affine automata and generalized affine automata
- Quantum finite automata: a modern introduction
- Deterministic construction of QFAs based on the quantum fingerprinting technique
- Improved constructions for succinct affine automata
- Affine automata verifiers
- Language Recognition Power and Succinctness of Affine Automata
- Languages Recognized with Unbounded Error by Quantum Finite Automata
This page was built for publication: Languages recognized by nondeterministic quantum finite automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3171611)
