On a class of languages recognizable by probabilistic reversible decide-and-halt automata

DOI10.1016/J.TCS.2009.01.042zbMath1163.68023OpenAlexW2011107310MaRDI QIDQ1017410

Marats Golovkins, Maksim Kravtsev, Vasilijs Kravcevs

Publication date: 19 May 2009

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

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

zbMATH Keywords

quantum automataprobabilistic automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68)

Cites Work

• Quantum automata and quantum grammars
• Characterizations of 1-Way Quantum Finite Automata
• STACS 2004
• Permutation automata
• Probabilistic automata
• On stochastic languages
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On a class of languages recognizable by probabilistic reversible decide-and-halt automata