Research in the theory of inductive inference by GDR mathematicians - A survey

Recent results in the theory of inductive inference are summarized. They concern deciphering of automata, language identification, prediction of functions, inference with additional information, strategies, functionals, index sets, characterization of identification types, uniform inference, and inference of nonrandom sequences. For proofs and further results in the field of inductive inference due to mathematicians of the German Democratic Republic a detailed bibliography is included.

[1]  Rolf Wiehagen,et al.  Rekursionstheoretische Charakterisierung von erkennbaren Klassen rekursiver Funktionen , 1977, J. Inf. Process. Cybern..

[2]  Rolf Wiehagen,et al.  Charakteristische Eigenschaften von erkennbaren Klassen rekursiver Funktionen , 1976, J. Inf. Process. Cybern..

[3]  Ludwig Staiger,et al.  Kompliziertheit von Lern- Und Erkennungsprozessen Internationales Symposium, 8. Bis 13. Oktober 1973 in Jena an der Sektion Mathematik der Friedrich-Schiller-Universität , 1975 .

[4]  John Doner,et al.  Tree Acceptors and Some of Their Applications , 1970, J. Comput. Syst. Sci..

[5]  Carl H. Smith,et al.  An Inductive Inference Bibliography , 1978 .

[6]  Edward F. Moore,et al.  Gedanken-Experiments on Sequential Machines , 1956 .

[7]  E. Mark Gold,et al.  Language Identification in the Limit , 1967, Inf. Control..

[8]  Rolf Wiehagen.  Inductive Inference of Recursive Functions , 1975, MFCS.

[9]  Ray J. Solomonoff,et al.  A Formal Theory of Inductive Inference. Part II , 1964, Inf. Control..

[10]  Günter Werner.  Prognose von Folgen , 1975, J. Inf. Process. Cybern..

[11]  Rolf Wiehagen,et al.  Identification of Formal Languages , 1977, MFCS.

[12]  Klaus P. Jantke.  Automatic synthesis of programs and inductive inference of functions , 1979, FCT.

[13]  Manuel Blum,et al.  A Machine-Independent Theory of the Complexity of Recursive Functions , 1967, JACM.

[14]  Jr. Hartley Rogers.  Theory of Recursive Functions and Effective Computability , 1969 .

[15]  Dana Angluin,et al.  Finding patterns common to a set of strings (Extended Abstract) , 1979, STOC.

[16]  Dana Angluin,et al.  Finding Patterns Common to a Set of Strings , 1980, J. Comput. Syst. Sci..

[17]  Reinhard Klette,et al.  Der Iterierte Limes Rekursiver Funktionen und Die Arithmetische Hierarchie , 1977, Math. Log. Q..

[18]  Robert P. Daley.  The Process Complexity and the Understanding of Sequences , 1973, MFCS.

[19]  Louise Hay,et al.  Index sets of finite classes of recursively enumerable sets , 1969, Journal of Symbolic Logic.

[20]  F. D. Lewis.  Classes of Recursive Functions and Their Index Sets , 1971 .

[21]  Rolf Wiehagen,et al.  Inductive Inference with Additional Information , 1979, J. Inf. Process. Cybern..

[22]  Ya. M. Barzdin,et al.  Towards a Theory of Inductive Inference (in Russian) , 1973, MFCS.

[23]  Peter H. Starke.  Über Diagnostische Strategien an Determinierten Automaten , 1973 .

[24]  C. Schnorr.  A Survey of the Theory of Random Sequences , 1977 .

[25]  Claus-Peter Schnorr,et al.  General Random Sequences and Learnable Sequences , 1977, J. Symb. Log..

[26]  Reinhard Klette.  Erkennung allgemein rekursiver Funktionen , 1976, J. Inf. Process. Cybern..

[27]  Reinhard Klette,et al.  Limes-rekursive Funktionen , 1975, J. Inf. Process. Cybern..

[28]  Reinhard Klette,et al.  Indexmengen und Erkennung Rekursiver Funktionen , 1976, Math. Log. Q..

[29]  Rolf Wiehagen.  Dechiffrierung von ND-Automaten , 1975, J. Inf. Process. Cybern..

[30]  Rolf Lindner.  Zufällig akzeptierte Sprachen , 1975, J. Inf. Process. Cybern..

[31]  Klaus P. Jantke,et al.  Natural Properties of Strategies Identifying Recursive Functions , 1979, J. Inf. Process. Cybern..

[32]  Rolf Wiehagen,et al.  Characterization Problems in the Theory of Inductive Inference , 1978, ICALP.

[33]  Manuel Blum,et al.  Toward a Mathematical Theory of Inductive Inference , 1975, Inf. Control..

[34]  Ludwig Staiger,et al.  Erkennungs-, Masz- Und Informationstheoretische Eigenschaften Regulärer Folgenmengen , 1977, Math. Log. Q..

[35]  Jerome A. Feldman,et al.  On the Synthesis of Finite-State Machines from Samples of Their Behavior , 1972, IEEE Transactions on Computers.

[36]  A. Salomaa.  Lindner, R./Staiger, L., Algebraische Codierungstheorie, Theorie der sequentiellen Codierungen. Berlin, Akademie-Verlag 1977. 268 S., M 48,– , 1979 .

[37]  Peter H. Starke.  Über Experimente an Automaten , 1967 .

[38]  Reinhard Klette,et al.  Some Properties of Limit Recursive Functions , 1974, MFCS.

[39]  Eliana Minicozzi,et al.  Some Natural Properties of Strong-Identification in Inductive Inference , 1976, Theor. Comput. Sci..