This is a preview of subscription content, log in via an institution.
References
Rayna, G. Degrees of finite-state transformability, Information and Control, 24(1974), 144–154.
Bukharajev, R.G. Osnovy theorii verojatnostnych automatov, Moskva, Nauka, 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Solovieva, V.R. (1987). The reducibility of random sequences by automata. 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_89
Download citation
DOI: https://doi.org/10.1007/3-540-18740-5_89
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