Characterizations of quantum automata
From MaRDI portal
Recommendations
- Publication:4710017
- Automata theory based on quantum logic: Some characterizations
- Characterizations of 1-Way Quantum Finite Automata
- Characterizations of one-way general quantum finite automata
- Quantum finite automata
- Quantum automata theory -- a review
- SOFSEM 2006: Theory and Practice of Computer Science
- Some remarks on quantum automata
- Quantum finite automata and weighted automata
Cites work
- scientific article; zbMATH DE number 2079870 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- Characterization of sequential quantum machines
- Characterizations of 1-Way Quantum Finite Automata
- Dense quantum coding and a lower bound for 1-way quantum automata
- Quantum automata and quantum grammars
- Quantum computers.
- Two-way finite automata with quantum and classical states.
Cited in
(28)- Quasi-deterministic finite automaton (QDFA)
- Promise problems solved by quantum and classical finite automata
- scientific article; zbMATH DE number 2079870 (Why is no real title available?)
- STACS 2005
- Hierarchy and equivalence of multi-letter quantum finite automata
- A theory of computation based on unsharp quantum logic: finite state automata and pushdown automata
- Quaternionic quantum automata
- Determination of equivalence between quantum sequential machines
- Quantum pushdown automata
- Efficient probability amplification in two-way quantum finite automata
- Pumping lemma for quantum automata
- Mirrors and memory in quantum automata
- Automata theory based on quantum logic: recognizability and accessibility
- Improved constructions of quantum automata
- scientific article; zbMATH DE number 1930739 (Why is no real title available?)
- Characterization of tree automata based on quantum logic
- Weakly regular quantum grammars and asynchronous quantum automata
- Characterizations of one-way general quantum finite automata
- Relativizations of nonuniform quantum finite automata families
- On the power of two-way multihead quantum finite automata
- Quantum finite automata
- Algebraic results on quantum automata
- Automata theory based on quantum logic: reversibilities and pushdown automata
- Finite state and finite stop quantum languages
- scientific article; zbMATH DE number 2221158 (Why is no real title available?)
- On coverings of products of uninitialized sequential quantum machines
- Analogues of quantum complementarity in the theory of automata
- Regular languages accepted by quantum automata
This page was built for publication: Characterizations of quantum automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1884961)
