Quantum automata and quantum grammars
Theoretical Computer Science
On the Class of Languages Recognizable by 1-Way Quantum Finite Automata
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
On the power of quantum finite state automata
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
1-way quantum finite automata: strengths, weaknesses and generalizations
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Optimal Lower Bounds for Quantum Automata and Random Access Codes
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Algebraic structure theory of sequential machines (Prentice-Hall international series in applied mathematics)
Probabilities to accept languages by quantum finite automata
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Some formal tools for analyzing quantum automata
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
On a class of languages recognizable by probabilistic reversible decide-and-halt automata
Theoretical Computer Science
Quantum computing: 1-way quantum automata
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Non-constructive methods for finite probabilistic automata
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Artin's conjecture and size of finite probabilistic automata
Pillars of computer science
Trace monoids with idempotent generators and measure-only quantum automata
Natural Computing: an international journal
Quantum finite automata and probabilistic reversible automata: R-trivial idempotent languages
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Characterizations of one-way general quantum finite automata
Theoretical Computer Science
Varieties generated by certain models of reversible finite automata
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
| Hi-index | 0.00 |
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.