Probabilistic Reversible Automata and Quantum Automata
| Autor: | Marats Golovkins, Maksim Kravtsev |
|---|---|
| Rok vydání: | 2002 |
| Předmět: |
Discrete mathematics
Probabilistic finite automata Nested word Computer science Timed automaton ω-automaton Nonlinear Sciences::Cellular Automata and Lattice Gases Mobile automaton Automaton Stochastic cellular automaton Deterministic finite automaton DFA minimization Continuous spatial automaton Automata theory Quantum finite automata Nondeterministic finite automaton Computer Science::Formal Languages and Automata Theory Quantum cellular automaton |
| Zdroj: | Lecture Notes in Computer Science ISBN: 9783540439967 COCOON |
| DOI: | 10.1007/3-540-45655-4_61 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|