1973 | |  | Finite Automata, Behavior and Synthesis - B. A. Trakhtenbrot and Ya. M. Barzdin |
| |  | Pattern Classification and Scene Analysis - R. O. Duda and P. E. Hart |
| |  | Towards a theory of inductive inference - J. M. Barzdin and K. M. Podnieks |
| |  | Identifiability of a Class of Transformational Grammars - H. Hamburger and K. Wexler |
| |  | The use of grammatical inference for designing programming languages - S M. M. A. Crespi-Reghizzi and L. Lichten |
| |  | On the Sufficiency of Surface Data for the Learning of Transformational Languages - K. Wexler and H. Hamburger |
| |  | Lernverfahren zur Erkennung formaler Sprachen - H. Thiele |
1974 | |  | Learning Automata - A Survey - K. S. Narendra and M. A. L. Thathachar |
| |  | Concerning synthesis and prediction of functions - J. M. Barzdin, E. B. Kinber and K. M. Podnieks |
| |  | Uniform and Non Uniform Predictability - R. Freivalds |
| |  | Über eine Eigenschaft Limes berechenbarer Funktionale - J. M. Barzdin |
| |  | Syntactic Methods in Pattern Recognition - K. S. Fu |
| |  | On the synthesis in the limit of almost minimal Gödel numbers - E. B. Kinber |
| |  | Comparing Various Concepts of Function Prediction, Part 1 - K. Podnieks |
| |  | Prediction and limiting synthesis of recursively enumerable classes of functions - J. M. Barzdin and R. Freivalds |
| |  | Periodicity in generations of automata - J. Case |
| |  | Limiting synthesis of t numbers - J. M. Barzdin |
| |  | On synthesizing programs given by examples - J. M. Barzdin |
| |  | Two Theorems on the Limiting Synthesis of Functions - J. M. Barzdin |
| |  | Approximate language identification - R. M. Wharton |
| |  | On the Complexity and Optimality of Computation in the Limit - R. Freivalds |
| |  | The syntactic inference problem for D0L sequences - P. G. Doucet |
| |  | On the limit synthesis of numbers of general recursive functions in various computable numerations - R. V. Freivalds |