Quantum \(\omega\)-automata over infinite words and their relationships

DOI10.1007/S10773-018-3983-0zbMath1412.68122OpenAlexW2911015661MaRDI QIDQ1741054

Amandeep Singh Bhatia, Ajay Kumar

Publication date: 3 May 2019

Published in: International Journal of Theoretical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10773-018-3983-0

zbMATH Keywords

quantum finite automataquantum \(\omega\)-automataquantum Muller automatonquantum Rabin automatonquantum Streett automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Quantum computation (81P68)

Related Items (2)

On relation between linear temporal logic and quantum finite automata ⋮ Characterization of tree automata based on quantum logic

Cites Work

• Unnamed Item
• Unnamed Item
• Superiority of exact quantum automata for promise problems
• Mathematical logic and quantum finite state automata
• Automata on infinite words. Ecole de Printemps d'Informatique Théorique, Le Mont Dore, May 14-18, 1984
• Quantum automata and quantum grammars
• Quantifying matrix product state
• Neurocomputing approach to matrix product state using quantum dynamics
• Modeling of RNA secondary structures using two-way quantum finite automata
• Characterizations of 1-Way Quantum Finite Automata
• Irreversibility and Heat Generation in the Computing Process
• Superiority of one-way and realtime quantum machines
• Testing and generating infinite sequences by a finite automaton
• Decidability of Second-Order Theories and Automata on Infinite Trees

This page was built for publication: Quantum \(\omega\)-automata over infinite words and their relationships