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.
@inproceedings{Ablayev88,
title = {Probabilistic Automata Complexity of Languages Depends on Language Structure and Error Probability},
author = {Farid M. Ablayev},
year = {1988},
researchr = {https://researchr.org/publication/Ablayev88},
cites = {0},
citedby = {0},
pages = {154-161},
booktitle = {Mathematical Foundations of Computer Science 1988, MFCS 88, Carlsbad, Czechoslovakia, August 29 - September 2, 1988, Proceedings},
editor = {Michal Chytil and Ladislav Janiga and Václav Koubek},
volume = {324},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-50110-X},
}