Gatis Midrijanis. The Complexity of Probabilistic versus Quantum Finite Automata. In William I. Grosky, Frantisek Plasil, editors, SOFSEM 2002: Theory and Practice of Informatics, 29th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 22-29, 2002, Proceedings. Volume 2540 of Lecture Notes in Computer Science, pages 273-278, Springer, 2002. [doi]
Abstract is missing.