3 papers
cs.FL2011
Quantum Finite Automata and Probabilistic Reversible Automata: R-trivial Idempotent Languages
Marats Golovkins, Maksim Kravtsev, Vasilijs Kravcevs
We study the recognition of R-trivial idempotent (R1) languages by various models of "decide-and-halt" quantum finite automata (QFA) and probabilistic reversible automata (DH-PRA).…
cs.CC2002
Probabilistic Reversible Automata and Quantum Automata
Marats Golovkins, Maksim Kravtsev
To study relationship between quantum finite automata and probabilistic finite automata, we introduce a notion of probabilistic reversible automata (PRA, or doubly stochastic autom…
quant-ph1999
Quantum Finite One-Counter Automata
Maksim Kravtsev
In this paper the notion of quantum finite one-counter automata (QF1CA) is introduced. Introduction of the notion is similar to that of the 2-way quantum finite state automata by A…