Abstract
New lower bound of complexity for probabilistic automata with error bounded probability was proved. It depends on the language structure and on error probability of recognition. It is shown that for languages which are "rich" with formulated property a new lower bound of probabilistic complexity is more precise than that of Rabin's lower bound. In addition with the help of a new lower bound we improve the hierarchy of complexity of probabilistic automata depending on error probability previously shown by the author.
Preview
Unable to display preview. Download preview PDF.
References
M.O. Rabin, Probabilistic automata, Information and Control, 1963, v.6, No.3, 230–245.
R.Frievald, On growing the number of states in determinisation of finite probabilistic automata, Avtomatika and vichislitelnaya technika, 1982, No.3, 39–42.
I.Pokrovskaya, Some bounds of the number of states of probabilistic automata recognizing regular languages, Problemy kebernetiky, 1979, No.36, 181–194.
F.M.Ablayev, The complexity of probabilistic automata with isolated cut point, Theoretical Computer science (to be published).
F.M. Ablayev, R. Freivald, Why sometimes probabilistic algorithms can be more effective, Lecture Notes in Computer Science, v.233, MFCS-1986, 1986, 1–14.
R.Freivald, I.Ikannicks, On some advantages of nondeterminate machines over probabilistic ones, Izvestiya VUZ Mathematica, 1977, No.21, 118–123.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ablayev, F.M. (1988). Probabilistic automata complexity of languages depends on language structure and error probability. In: Chytil, M.P., Koubek, V., Janiga, L. (eds) Mathematical Foundations of Computer Science 1988. MFCS 1988. Lecture Notes in Computer Science, vol 324. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017138
Download citation
DOI: https://doi.org/10.1007/BFb0017138
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50110-7
Online ISBN: 978-3-540-45926-2
eBook Packages: Springer Book Archive