Janis Kaneps. Regularity of One-Letter Languages Acceptable by 2-Way Finite Probabilistic Automata. In Lothar Budach, editor, Fundamentals of Computation Theory, 8th International Symposium, FCT 91, Gosen, Germany, September 9-13, 1991, Proceedings. Volume 529 of Lecture Notes in Computer Science, pages 287-296, Springer, 1991.
Abstract is missing.