Dense quantum coding and a lower bound for 1-way quantum automata
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
How to simulate free will in a computational device
ACM Computing Surveys (CSUR)
The Complexity of Probabilistic versus Quantum Finite Automata
SOFSEM '02 Proceedings of the 29th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Improved constructions of mixed state quantum automata
Theoretical Computer Science
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
Journal of the ACM (JACM)
On the Size of Unary Probabilistic and Nondeterministic Automata
Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
Hamming, permutations and automata
SAGA'07 Proceedings of the 4th international conference on Stochastic Algorithms: foundations and applications
| Hi-index | 0.00 |