Running Time to Recognize Nonregular Languages by 2-Way Probabilistic Automata

Janis Kaneps, Rusins Freivalds. Running Time to Recognize Nonregular Languages by 2-Way Probabilistic Automata. In Javier Leach Albert, Burkhard Monien, Mario Rodríguez-Artalejo, editors, Automata, Languages and Programming, 18th International Colloquium, ICALP91, Madrid, Spain, July 8-12, 1991, Proceedings. Volume 510 of Lecture Notes in Computer Science, pages 174-185, Springer, 1991.

Abstract

Abstract is missing.