On the power of two-way multihead quantum finite automata
From MaRDI portal
Publication:5223828
Recommendations
- Succinctness of two-way probabilistic and quantum finite automata
- Some algebraic properties of measure-once two-way quantum finite automata
- Efficient probability amplification in two-way quantum finite automata
- scientific article; zbMATH DE number 1490003
- State succinctness of two-way finite automata with quantum and classical states
- On the power of one-way automata with quantum and classical states
- On the power of one-way automata with quantum and classical states
- Multi-letter quantum finite automata: decidability of the equivalence and minimization of states
Cites work
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3690693 (Why is no real title available?)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 3254905 (Why is no real title available?)
- A deterministic two-way multi-head finite automaton can be converted into a reversible one with the same number of heads
- Bounded-reversal multihead finite automata languages
- Characterization of sequential quantum machines
- Characterizations of one-way general quantum finite automata
- Characterizations of quantum automata
- Complexity of multi-head finite automata: origins and directions
- Determination of equivalence between quantum sequential machines
- Determining the equivalence for one-way quantum finite automata
- Exponentially more concise quantum recognition of non-RMM regular languages
- Handbook of Finite State Based Models and Applications
- Hierarchy and equivalence of multi-letter quantum finite automata
- Modeling of RNA secondary structures using two-way quantum finite automata
- Multi-letter Reversible and Quantum Finite Automata
- Multi-letter quantum finite automata: decidability of the equivalence and minimization of states
- On Multi-Head Finite Automata
- On the complexity of minimizing probabilistic and quantum automata
- On the state complexity of semi-quantum finite automata
- On two-way multihead automata
- One-way reversible multi-head finite automata
- Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata
- Promise problems solved by quantum and classical finite automata
- Quantifying matrix product state
- Quantum automata and quantum grammars
- Quantum computation and quantum information. 10th anniversary edition
- Quantum computers.
- Reversible space equals deterministic space
- Some languages recognized by two-way finite automata with quantum and classical states
- State succinctness of two-way finite automata with quantum and classical states
- Two-tape finite automata with quantum and classical states
- Two-way finite automata with quantum and classical states.
- Two-way reversible multi-head finite automata
- Undecidability on quantum finite automata
Cited in
(3)
This page was built for publication: On the power of two-way multihead quantum finite automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5223828)
