Interference automata

DOI10.1016/j.tcs.2008.05.006zbMath1156.68034OpenAlexW2913298164MaRDI QIDQ2518378

M. V. Panduranga Rao

Publication date: 15 January 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.05.006

zbMATH Keywords

interferencequantum computingquantum finite automataautomata with quantum and classical statesdeterministic counter automata

Mathematics Subject Classification ID

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

Related Items (1)

Two-tape finite automata with quantum and classical states

Cites Work

• Remarks on two-way automata with weak-counters
• Deterministic two-way one-head pushdown automata are very powerful
• Two-way deterministic multi-weak-counter machines
• Remarks on blind and partially blind one-way multicounter machines
• Quantum automata and quantum grammars
• Two-way finite automata with quantum and classical states.
• Characterizations of 1-Way Quantum Finite Automata
• Two-Way Counter Machines and Diophantine Equations
• ON THE EQUIVALENCE OF TWO-WAY PUSHDOWN AUTOMATA AND COUNTER MACHINES OVER BOUNDED LANGUAGES
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Interference automata