Small size quantum automata recognizing some regular languages
From MaRDI portal
Publication:2484448
DOI10.1016/j.tcs.2005.03.032zbMath1087.68047OpenAlexW2005863923MaRDI QIDQ2484448
Beatrice Palano, Carlo Mereghetti, Alberto Bertoni
Publication date: 1 August 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.03.032
Related Items
One-Way Finite Automata with Quantum and Classical States ⋮ Complexity of Promise Problems on Classical and Quantum Automata ⋮ From Quantum Query Complexity to State Complexity ⋮ Potential of Quantum Finite Automata with Exact Acceptance ⋮ Size lower bounds for quantum automata ⋮ On the Power of One-Way Automata with Quantum and Classical States ⋮ Exponentially more concise quantum recognition of non-RMM regular languages ⋮ Preface ⋮ Quantum automata for some multiperiodic languages ⋮ Promise problems solved by quantum and classical finite automata ⋮ Quantum finite automata: advances on Bertoni's ideas ⋮ Some formal tools for analyzing quantum automata. ⋮ Characterizations of one-way general quantum finite automata ⋮ Quantum finite automata with control language
Cites Work
- Quantum automata and quantum grammars
- Regular languages accepted by quantum automata
- Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata
- Characterizations of 1-Way Quantum Finite Automata
- Scale-sensitive dimensions, uniform convergence, and learnability
- On the Size of One-way Quantum Finite Automata with Periodic Behaviors
- Probability Inequalities for Sums of Bounded Random Variables
- Probabilistic automata
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- GOLOMB RULERS AND DIFFERENCE SETS FOR SUCCINCT QUANTUM AUTOMATA
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Small size quantum automata recognizing some regular languages
