Regular languages accepted by quantum automata
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 41838 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- scientific article; zbMATH DE number 3337815 (Why is no real title available?)
- scientific article; zbMATH DE number 3371972 (Why is no real title available?)
- A method for obtaining digital signatures and public-key cryptosystems
- An introduction to Hilbert space and quantum logic
- Analogies and differences between quantum and stochastic automata
- Characterizations of 1-Way Quantum Finite Automata
- Logical Reversibility of Computation
- Quantum complexity theory
- Quantum computation
- Quantum computational networks
- Quantum mechanical Hamiltonian models of Turing machines
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Rapid solution of problems by quantum computation
- Realizable Universal Quantum Logic Gates
- Some Bounds on the Storage Requirements of Sequential Machines and Turing Machines
Cited in
(25)- Analogies and differences between quantum and stochastic automata
- Quantum reversible fuzzy grammars
- Exponentially more concise quantum recognition of non-RMM regular languages
- Properties of quantum languages
- Trace monoids with idempotent generators and measure-only quantum automata
- Characterizations of one-way general quantum finite automata
- Automata theory based on quantum logic: Some characterizations
- Efficient probability amplification in two-way quantum finite automata
- Some algebraic properties of measure-once two-way quantum finite automata
- Complexity of promise problems on classical and quantum automata
- A note on quantum sequential machines
- Determination of equivalence between quantum sequential machines
- Determining the equivalence for one-way quantum finite automata
- Quantum automata for some multiperiodic languages
- Small size quantum automata recognizing some regular languages
- Some formal tools for analyzing quantum automata.
- On hybrid models of quantum finite automata
- Energy complexity of regular languages
- Energy complexity of regular language recognition
- Weakly regular quantum grammars and asynchronous quantum automata
- Reversible computations of one-way counter automata
- Quantum finite automata with control language
- GOLOMB RULERS AND DIFFERENCE SETS FOR SUCCINCT QUANTUM AUTOMATA
- Quantum finite automata: advances on Bertoni's ideas
- Preface
This page was built for publication: Regular languages accepted by quantum automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854417)
