Probabilistic Automata Complexity of Languages Depends on Language Structure and Error Probability

Farid M. Ablayev. Probabilistic Automata Complexity of Languages Depends on Language Structure and Error Probability. In Michal Chytil, Ladislav Janiga, Václav Koubek, editors, Mathematical Foundations of Computer Science 1988, MFCS 88, Carlsbad, Czechoslovakia, August 29 - September 2, 1988, Proceedings. Volume 324 of Lecture Notes in Computer Science, pages 154-161, Springer, 1988.

Abstract

Abstract is missing.