Skip to content

Quantum Finite Automata and Probabilistic Reversible Automata: R-trivial Idempotent Languages.

Marats Golovkins, Maksim Kravtsev, Vasilijs Kravcevs

VenueBMFCS
Year2011
ProceedingsMFCS

Browse the full MFCS paper archive.