Another approach to the equivalence of measure-many one-way quantum finite automata and its application
From MaRDI portal
Publication:439940
DOI10.1016/j.jcss.2012.01.004zbMath1252.68177OpenAlexW2048074284MaRDI QIDQ439940
Publication date: 17 August 2012
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2012.01.004
equivalencequantum finite automataenhanced one-way quantum finite automatameasure-many one-way quantum finite automata
Formal languages and automata (68Q45) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The equivalence problem of multitape finite automata
- The equivalence problem of multidimensional multitape automata
- A note on quantum sequential machines
- Quantum computing.
- Quantum automata and quantum grammars
- Reduced forms for stochastic sequential machines
- Computing with quanta -- impacts of quantum theory on computation.
- Two-way finite automata with quantum and classical states.
- Hierarchy and equivalence of multi-letter quantum finite automata
- Algebraic results on quantum automata
- Determination of equivalence between quantum sequential machines
- Determining the equivalence for one-way quantum finite automata
- Undecidability on quantum finite automata
- Quantum computational networks
- Characterizations of 1-Way Quantum Finite Automata
- Languages Recognized with Unbounded Error by Quantum Finite Automata
- Various Aspects of Finite Quantum Automata
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Quantum Complexity Theory
This page was built for publication: Another approach to the equivalence of measure-many one-way quantum finite automata and its application
