On the languages accepted by finite reversible automata
14th International Colloquium on Automata, languages and programming
Descriptional complexity issues in quantum computing
Journal of Automata, Languages and Combinatorics
Regular languages accepted by quantum automata
Information and Computation
Quantum automata and quantum grammars
Theoretical Computer Science
Characterizations of 1-Way Quantum Finite Automata
SIAM Journal on Computing
1-way quantum finite automata: strengths, weaknesses and generalizations
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Small size quantum automata recognizing some regular languages
Theoretical Computer Science - The art of theory
Some formal tools for analyzing quantum automata
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Quantum computing: 1-way quantum automata
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Behaviours of Unary Quantum Automata
Fundamenta Informaticae - Non-Classical Models of Automata and Applications
Characterizations of one-way general quantum finite automata
Theoretical Computer Science
Hi-index | 5.23 |
We exhibit small size measure-once one-way quantum finite automata (mo-1qfa's) inducing multiperiodic stochastic events. Moreover, for certain classes of multiperiodic languages, we exhibit: (i) isolated cut point mo-1qfa's whose size logarithmically depends on the periods; (ii) Monte Carlo mo-1qfa's whose size logarithmically depends on the periods and polynomially on the inverse of the error probability.