scientific article
From MaRDI portal
Publication:3171611
zbMath1236.81071MaRDI QIDQ3171611
Abuzer Yakaryılmaz, A. C. Cem Say
Publication date: 5 October 2011
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
probabilistic automatanondeterministic quantum finite automataone-sided unbounded errorsublogarithmic space complexitytwo-sided unbounded error
Formal languages and automata (68Q45) Quantum computation (81P68) Cellular automata (computational aspects) (68Q80) Error bounds for numerical methods for ordinary differential equations (65L70) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items (22)
Unary probabilistic and quantum automata on promise problems ⋮ Quantum alternation ⋮ Very narrow quantum OBDDs and width hierarchies for classical OBDDs ⋮ Affine automata verifiers ⋮ Nondeterministic unitary OBDDs ⋮ Unnamed Item ⋮ Quantum Finite Automata: A Modern Introduction ⋮ State succinctness of two-way finite automata with quantum and classical states ⋮ Deterministic construction of QFAs based on the quantum fingerprinting technique ⋮ Language recognition power and succinctness of affine automata ⋮ Computational limitations of affine automata and generalized affine automata ⋮ On a Conjecture by Christian Choffrut ⋮ More on quantum, stochastic, and pseudo stochastic languages with few states ⋮ Quantum computation with write-only memory ⋮ Affine Computation and Affine Automaton ⋮ Unbounded-error quantum computation with small space bounds ⋮ Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice ⋮ Language Recognition Power and Succinctness of Affine Automata ⋮ Uncountable classical and quantum complexity classes ⋮ Languages Recognized with Unbounded Error by Quantum Finite Automata ⋮ Looking for Pairs that Hard to Separate: A Quantum Approach ⋮ Improved constructions for succinct affine automata
This page was built for publication:
