Weakly regular quantum grammars and asynchronous quantum automata

DOI10.1007/s10773-008-9808-9zbMath1162.81357OpenAlexW2050204936WikidataQ62038208 ScholiaQ62038208MaRDI QIDQ1013764

Zhengjun Xi, Xin Wang, Yong-Ming Li

Publication date: 21 April 2009

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

Full work available at URL: https://doi.org/10.1007/s10773-008-9808-9

zbMATH Keywords

asynchronous quantum automataregular quantum grammarssynchronous quantum automataweakly regular quantum grammars

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Quantum computation (81P68) Automata and formal grammars in connection with logical questions (03D05) Grammars and rewriting systems (68Q42)

Cites Work

• Unnamed Item
• Unnamed Item
• Quantum mechanical Hamiltonian models of Turing machines
• Lattices of quantum automata
• Quantum automata and quantum grammars
• Automata of asynchronous behaviors
• Characterization of sequential quantum machines
• Quantum evolution of words
• About synchronous programming and abstract interpretation
• True concurrency in models of asynchronous circuit behavior
• Characterizations of quantum automata
• Determination of equivalence between quantum sequential machines
• Quantum computational networks
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Quantum Complexity Theory
• Quantum computers.

This page was built for publication: Weakly regular quantum grammars and asynchronous quantum automata