On the power of two-way multihead quantum finite automata
DOI10.1051/ITA/2018020zbMATH Open1418.81016OpenAlexW2910335177MaRDI QIDQ5223828FDOQ5223828
Authors: Amandeep Singh Bhatia, Ajay Kumar 
Publication date: 18 July 2019
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1051/ita/2018020
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
two-way deterministic finite automata (2DFA)two-way deterministic multihead finite automata (DMFA)two-way multihead quantum finite automata (2MQFA)two-way quantum finite automata (2QFA)two-way reversible finite automata (2RFA)two-way reversible multihead finite automata (RMFA)
Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68)
Cites Work
- Two-way finite automata with quantum and classical states.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Quantum computation and quantum information. 10th anniversary edition
- Exponentially more concise quantum recognition of non-RMM regular languages
- On the state complexity of semi-quantum finite automata
- Characterizations of one-way general quantum finite automata
- On Multi-Head Finite Automata
- One-way reversible multi-head finite automata
- Title not available (Why is that?)
- Quantum automata and quantum grammars
- Hierarchy and equivalence of multi-letter quantum finite automata
- Determination of equivalence between quantum sequential machines
- Determining the equivalence for one-way quantum finite automata
- State succinctness of two-way finite automata with quantum and classical states
- Some languages recognized by two-way finite automata with quantum and classical states
- Promise problems solved by quantum and classical finite automata
- Characterizations of quantum automata
- Quantum computers.
- Complexity of multi-head finite automata: origins and directions
- Undecidability on quantum finite automata
- Two-way reversible multi-head finite automata
- Bounded-reversal multihead finite automata languages
- Multi-letter Reversible and Quantum Finite Automata
- On the complexity of minimizing probabilistic and quantum automata
- Multi-letter quantum finite automata: decidability of the equivalence and minimization of states
- Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata
- Characterization of sequential quantum machines
- Two-tape finite automata with quantum and classical states
- Title not available (Why is that?)
- On two-way multihead automata
- Modeling of RNA secondary structures using two-way quantum finite automata
- A deterministic two-way multi-head finite automaton can be converted into a reversible one with the same number of heads
- Reversible space equals deterministic space
- Quantifying matrix product state
- Handbook of Finite State Based Models and Applications
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)
