Complexity of Probabilistic Versus Deterministic Automata

Rusins Freivalds. Complexity of Probabilistic Versus Deterministic Automata. In Janis Barzdins, Dines Bjørner, editors, Baltic Computer Science, Selected Papers. Volume 502 of Lecture Notes in Computer Science, pages 565-613, Springer, 1991.

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.