Exact Results for Accepting Probabilities of Quantum Automata
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Upper Bounds on the Size of One-Way Quantum Finite Automata
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Polynomial-Time Algorithms for the Equivalence for One-Way Quantum Finite Automata
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
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
Exact results for accepting probabilities of quantum automata
Theoretical Computer Science - Mathematical foundations of computer science
Small size quantum automata recognizing some regular languages
Theoretical Computer Science - The art of theory
Quantum automata for some multiperiodic languages
Theoretical Computer Science
Determining the equivalence for one-way quantum finite automata
Theoretical Computer Science
Efficient probability amplification in two-way quantum finite automata
Theoretical Computer Science
Quantum computing: 1-way quantum automata
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Algebraic methods in quantum informatics
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
Behaviours of Unary Quantum Automata
Fundamenta Informaticae - Non-Classical Models of Automata and Applications
Journal of Computer and System Sciences
Languages recognizable by quantum finite automata
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
State succinctness of two-way finite automata with quantum and classical states
Theoretical Computer Science
| Hi-index | 0.00 |