On a class of languages recognizable by probabilistic reversible decide-and-halt automata
From MaRDI portal
Publication:1017410
DOI10.1016/j.tcs.2009.01.042zbMath1163.68023MaRDI 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
68Q45: Formal languages and automata
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
81P68: Quantum computation
Cites Work