Computer Science – Computational Complexity
Scientific paper
2002-09-16
Lecture Notes in Computer Science, 2002, Vol. 2387, pp. 574-583
Computer Science
Computational Complexity
COCOON 2002, extended version of the paper, 22 pages
Scientific paper
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.
Golovkins Marats
Kravtsev Maksim
No associations
LandOfFree
Probabilistic Reversible Automata and Quantum Automata does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Probabilistic Reversible Automata and Quantum Automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Probabilistic Reversible Automata and Quantum Automata will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-291735