Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
M.O. Rabin. Probabilistic automata, — Infermation and Control, 1963, v. 6, No. 3, p. 230–245.
R. Freivald. Capabilities of various models of probabilistic one-way automata, — Izvestija VUZ Mathematica, 1981, No. 5, p. 26–34, (in Russian).
F.M. Ablaev. Capabilities of probabilistic machines to represent languages in real time. — Izvestija VUZ Mathematica, 1985, No. 7, p. 32–40 (in Russian).
R. Freidzen. About one measure of complexity of recursive predicate. — Trudy Instituta Matematiki AN USSR, 1969, v. 113, p. 79–101 (in Russian).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ablaev, F.M. (1987). Possibilities of probabilistic on-line counting machines. In: Budach, L., Bukharajev, R.G., Lupanov, O.B. (eds) Fundamentals of Computation Theory. FCT 1987. Lecture Notes in Computer Science, vol 278. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18740-5_1
Download citation
DOI: https://doi.org/10.1007/3-540-18740-5_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18740-0
Online ISBN: 978-3-540-48138-6
eBook Packages: Springer Book Archive