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).…