Chapter PDF
References
R.P. Daley THE PROCESS COMPLEXITY AND THE UNDERSTANDING OF SEQUENCES. Proceedings of Symposium and Summer School MFCS, High Tatras, September 3–8, 1973.
P.H. Fuchs PROGRAMMKOMPLEXITÄT, ZUFÄLLIGKEIT, LERNBARKEIT. Dissertation, Frankfurt 1975.
L.A. Levin ON THE NOTION OF A RANDOM SEQUENCE. Soviet Math. Dokl. 14, 1973.
C.P. Schnorr P.H. Fuchs THE COINCIDENCE OF LEARNABLE, OF OPTIMALLY COMPRESSIBLE AND OF GENERAL RANDOM SEQUENCES. Preprint, Fachbereich Mathematik, Universität Frankfurt 1975.
C.P. Schnorr ZUFÄLLIGKEIT UND WAHRSCHEINLICHKEIT. Lecture Notes in Math., vol 218, Berlin and New York, 1971.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1975 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fuchs, P.H. (1975). Statistical characterization of learnable sequences. In: Brakhage, H. (eds) Automata Theory and Formal Languages. Lecture Notes in Computer Science, vol 33. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07407-4_6
Download citation
DOI: https://doi.org/10.1007/3-540-07407-4_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07407-6
Online ISBN: 978-3-540-37923-2
eBook Packages: Springer Book Archive