More on quantum, stochastic, and pseudo stochastic languages with few states
From MaRDI portal
Publication:2003453
DOI10.1007/S11047-015-9511-8zbMath1415.68139OpenAlexW1205221740MaRDI QIDQ2003453
Arseny M. Shur, Abuzer Yakaryılmaz
Publication date: 8 July 2019
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11047-015-9511-8
context-free languagesregular languagesquantum finite automataunary languagesprobabilistic finite automatageneralized finite automatastochastic languages
Related Items (5)
Unary probabilistic and quantum automata on promise problems ⋮ Uncountable realtime probabilistic classes ⋮ Language recognition power and succinctness of affine automata ⋮ Uncountable classical and quantum complexity classes ⋮ The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints
Cites Work
- Unbounded-error quantum computation with small space bounds
- Quantum automata and quantum grammars
- \(\text{NQP}_\mathbb{C}=\text{co-C}_=\text{P}\)
- Quantum Finite Automata: A Modern Introduction
- Quantum, Stochastic, and Pseudo Stochastic Languages with Few States
- Characterizations of 1-Way Quantum Finite Automata
- Languages Recognized with Unbounded Error by Quantum Finite Automata
- Word-functions of stochastic and pseudo stochastic automata
- On Context-Free Languages
- Probabilistic automata
- Generalized Automata and Stochastic Languages
- On stochastic languages
- Analogies and differences between quantum and stochastic automata
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: More on quantum, stochastic, and pseudo stochastic languages with few states
