STACS 2004
From MaRDI portal
Publication:5309690
DOI10.1007/B96012zbMath1122.68079OpenAlexW4236485840MaRDI QIDQ5309690
Martin Beaudry, Arnolds Ķikusts, Marats Golovkins, Denis Thérien, Mark Mercer, Andris Ambainis
Publication date: 1 October 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b96012
Formal languages and automata (68Q45) Quantum computation (81P68) Algebraic theory of languages and automata (68Q70)
Related Items (4)
On language varieties without Boolean operations ⋮ An application of quantum finite automata to interactive proof systems ⋮ On a class of languages recognizable by probabilistic reversible decide-and-halt automata ⋮ Mathematical logic and quantum finite state automata
This page was built for publication: STACS 2004
