3 citations · 3 across the 5 of their papers we have counts for
1 paper · 1 filter
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).…