On the power of two-way multihead quantum finite automata

DOI10.1051/ita/2018020zbMath1418.81016OpenAlexW2910335177MaRDI QIDQ5223828

Ajay Kumar, Amandeep Singh Bhatia

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

zbMATH Keywords

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)

Mathematics Subject Classification ID

Related Items (3)

QPSO-CD: quantum-behaved particle swarm optimization algorithm with Cauchy distribution ⋮ On relation between linear temporal logic and quantum finite automata ⋮ Characterization of tree automata based on quantum logic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• State succinctness of two-way finite automata with quantum and classical states
• Exponentially more concise quantum recognition of non-RMM regular languages
• Promise problems solved by quantum and classical finite automata
• Two-tape finite automata with quantum and classical states
• Complexity of multi-head finite automata: origins and directions
• On the complexity of minimizing probabilistic and quantum automata
• Characterizations of one-way general quantum finite automata
• Multi-letter quantum finite automata: decidability of the equivalence and minimization of states
• Quantum automata and quantum grammars
• Reversible space equals deterministic space
• Characterization of sequential quantum machines
• Quantifying matrix product state
• Two-way finite automata with quantum and classical states.
• Characterizations of quantum automata
• Modeling of RNA secondary structures using two-way quantum finite automata
• Hierarchy and equivalence of multi-letter quantum finite automata
• Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata
• Determination of equivalence between quantum sequential machines
• Determining the equivalence for one-way quantum finite automata
• On two-way multihead automata
• Undecidability on quantum finite automata
• Quantum Computation and Quantum Information
• Two-Way Reversible Multi-Head Finite Automata
• Handbook of Finite State Based Models and Applications
• One-Way Reversible Multi-head Finite Automata
• 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
• SOME LANGUAGES RECOGNIZED BY TWO-WAY FINITE AUTOMATA WITH QUANTUM AND CLASSICAL STATES
• On the state complexity of semi-quantum finite automata
• Multi-letter Reversible and Quantum Finite Automata
• On Multi-Head Finite Automata
• Quantum computers.

This page was built for publication: On the power of two-way multihead quantum finite automata