Quantum Finite Automata and Probabilistic Reversible Automata: R-trivial Idempotent Languages
From MaRDI portal
Publication:3088053
DOI10.1007/978-3-642-22993-0_33zbMath1343.68138OpenAlexW2159977508MaRDI QIDQ3088053
Maksim Kravtsev, Marats Golovkins, Vasilijs Kravcevs
Publication date: 17 August 2011
Published in: Mathematical Foundations of Computer Science 2011 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22993-0_33
Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items (1)
This page was built for publication: Quantum Finite Automata and Probabilistic Reversible Automata: R-trivial Idempotent Languages
