Abstract
To study relationship between quantum finite automata and probabilistic finite automata, we introduce a notion of probabilistic reversible automata (PRA, or doubly stochastic automata). We find that there is a strong relationship between different possible models of PRA and corresponding models of quantum finite automata. We also propose a classification of reversible finite 1-way automata.
Cite
CITATION STYLE
Golovkins, M., & Kravtsev, M. (2002). Probabilistic reversible automata and quantum automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2387, pp. 574–583). Springer Verlag. https://doi.org/10.1007/3-540-45655-4_61
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
