Languages Recognized with Unbounded Error by Quantum Finite Automata
From MaRDI portal
Recommendations
- Implementation and Application of Automata
- Languages recognized by nondeterministic quantum finite automata
- scientific article; zbMATH DE number 1405684
- scientific article; zbMATH DE number 1688355
- Undecidability on quantum finite automata
- Lower bounds on the size of quantum automata accepting unary languages.
- Quantum finite automata and linear context-free languages: a decidable problem
- The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints
- Potential of quantum finite automata with exact acceptance
Cites work
- A context-free language which is not acceptable by a probabilistic automaton
- Algebraic results on quantum automata
- Analogies and differences between quantum and stochastic automata
- Characterizations of 1-Way Quantum Finite Automata
- Classical simulation complexity of quantum machines.
- Determining the equivalence for one-way quantum finite automata
- Efficient probability amplification in two-way quantum finite automata
- Generalized Automata and Stochastic Languages
- scientific article; zbMATH DE number 2040892 (Why is no real title available?)
- scientific article; zbMATH DE number 3371972 (Why is no real title available?)
- Languages recognized by nondeterministic quantum finite automata
- Probabilistic automata
- Quantum automata and quantum grammars
- Quantum Complexity Theory
- Quantum Computability
- Space-bounded quantum complexity
- Two-way finite automata with quantum and classical states.
- Undecidability on quantum finite automata
Cited in
(24)- Exact results for accepting probabilities of quantum automata.
- Simulation methods for quantum walks on graphs applied to formal language recognition
- More on quantum, stochastic, and pseudo stochastic languages with few states
- Affine automata verifiers
- Language Recognition Power and Succinctness of Affine Automata
- Characterizations of 1-Way Quantum Finite Automata
- Languages recognized by nondeterministic quantum finite automata
- Complexity bounds of constant-space quantum computation
- scientific article; zbMATH DE number 6533717 (Why is no real title available?)
- scientific article; zbMATH DE number 35744 (Why is no real title available?)
- Another approach to the equivalence of measure-many one-way quantum finite automata and its application
- scientific article; zbMATH DE number 1490003 (Why is no real title available?)
- Exponentially more concise quantum recognition of non-RMM regular languages
- scientific article; zbMATH DE number 1834645 (Why is no real title available?)
- scientific article; zbMATH DE number 1405684 (Why is no real title available?)
- The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints
- Uncountable classical and quantum complexity classes
- Unbounded-error quantum computation with small space bounds
- Affine computation and affine automaton
- Implementation and Application of Automata
- Language recognition power and succinctness of affine automata
- A new family of nonstochastic languages
- Characterizations of one-way general quantum finite automata
- Multi-letter quantum finite automata: decidability of the equivalence and minimization of states
This page was built for publication: Languages Recognized with Unbounded Error by Quantum Finite Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3392970)
