More on quantum, stochastic, and pseudo stochastic languages with few states
From MaRDI portal
Publication:2003453
Recommendations
- Quantum, stochastic, and pseudo stochastic languages with few states
- The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints
- Analogies and differences between quantum and stochastic automata
- Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata
- On the size of unary probabilistic and nondeterministic automata
Cites work
- scientific article; zbMATH DE number 3588051 (Why is no real title available?)
- scientific article; zbMATH DE number 3371972 (Why is no real title available?)
- scientific article; zbMATH DE number 3407560 (Why is no real title available?)
- Analogies and differences between quantum and stochastic automata
- Characterizations of 1-Way Quantum Finite Automata
- Generalized Automata and Stochastic Languages
- Languages Recognized with Unbounded Error by Quantum Finite Automata
- Languages recognized by nondeterministic quantum finite automata
- On Context-Free Languages
- On stochastic languages
- Probabilistic automata
- Quantum automata and quantum grammars
- Quantum finite automata: a modern introduction
- Quantum, stochastic, and pseudo stochastic languages with few states
- Unbounded-error quantum computation with small space bounds
- Word-functions of stochastic and pseudo stochastic automata
- \(\text{NQP}_\mathbb{C}=\text{co-C}_=\text{P}\)
Cited in
(4)
This page was built for publication: More on quantum, stochastic, and pseudo stochastic languages with few states
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2003453)
