Small size quantum automata recognizing some regular languages
From MaRDI portal
Publication:2484448
DOI10.1016/J.TCS.2005.03.032zbMATH Open1087.68047OpenAlexW2005863923MaRDI QIDQ2484448FDOQ2484448
Authors: Carlo Mereghetti, Beatrice Palano, 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
Recommendations
Cites Work
- Probability Inequalities for Sums of Bounded Random Variables
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Probabilistic automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Quantum automata and quantum grammars
- Characterizations of 1-Way Quantum Finite Automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Scale-sensitive dimensions, uniform convergence, and learnability
- Regular languages accepted by quantum automata
- On the Size of One-way Quantum Finite Automata with Periodic Behaviors
- GOLOMB RULERS AND DIFFERENCE SETS FOR SUCCINCT QUANTUM AUTOMATA
- Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata
- Title not available (Why is that?)
Cited In (19)
- On the power of one-way automata with quantum and classical states
- Size lower bounds for quantum automata
- Exponentially more concise quantum recognition of non-RMM regular languages
- From quantum query complexity to state complexity
- Characterizations of one-way general quantum finite automata
- Lower bounds on the size of quantum automata accepting unary languages.
- Quantum automata and periodic events
- Promise problems solved by quantum and classical finite automata
- Behaviours of unary quantum automata
- One-way finite automata with quantum and classical states
- On the Size of One-way Quantum Finite Automata with Periodic Behaviors
- Complexity of promise problems on classical and quantum automata
- Potential of quantum finite automata with exact acceptance
- Quantum automata for some multiperiodic languages
- Some formal tools for analyzing quantum automata.
- Title not available (Why is that?)
- Quantum finite automata with control language
- Quantum finite automata: advances on Bertoni's ideas
- Preface
This page was built for publication: Small size quantum automata recognizing some regular languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2484448)
