1977 | |  | On the inference of optimal descriptions - R. Daley |
| |  | Algorithms for producing grammars from sample derivations: a common problem of formal language theory and developmental biology - H. Feliciangeli and G. Herman |
| |  | A note on the k-tail method of tree grammar inference - J. M. Brayer and K. S. Fu |
| |  | Query-by-Example: a data base language - M. Zloof |
| |  | Grammar enumeration and inference - R. M. Wharton |
| |  | A class of synthesizeable LISP programs - D. R. Smith |
| |  | Identification of formal languages - R. Wiehagen |
| |  | A few results on the complexity of classes of identifiable recursive function sets - R. Klette |
| |  | Inductive Inference of Automata, Functions and Programs - J. M. Barzdin |
| |  | Inference of finite-state probabilistic grammars - F. J. Maryanski and T. L. Booth |
| |  | Rekursionstheoretische charakterisierung von erkennbaren klassen rekursiver funktionen - R. Wiehagen and H. Jung |
| |  | Induction, Pure and Simple - P. Kugel |
| |  | Limit Identification of Minimal Gödel Numbers - R. Freivalds and E. B. Kinber |
| |  | Probabilistic Program Synthesis - K. Podnieks |
| |  | The hierarchical synthesis of LISP scanning functions - A. W. Biermann and D. R. Smith |
| |  | Total complexity and the inference of best programs - J. A. Feldman and P. Shields |
| |  | Zur Untersuchung von Abstrakten Interaktiven Erkennungssystemen - H. Jung |
| |  | SISP/1, an interactive system able to synthesize functions from examples - J. P. G. G. Jouannaud and T. P. Treuil |
| |  | On a Theory of Inductive Inference - E. B. Kinber |
| |  | Maximum-likelihood from Incomplete Data via the EM Algorithm - A. P. Dempster, N. M. Laird and D. B Rubin |
| |  | On Limit Identification of Minimal Gödel Numbers for Functions from Enumerable Classes - E. B. Kinber |
| |  | An Adaptive Optimal Controller for Discrete-Time Markov Environments - I. H. Witten |
| January |  | A methodology for LISP program construction from examples - P. D. Summers |
| August |  | Version Spaces: A Candidate Elimination Approach to Rule Learning - T. M. Mitchell |