1977 | | | **Identification of formal languages** - *R. Wiehagen* |

| | | **SISP/1, an interactive system able to synthesize functions from examples** - *J. P. Jouannaud and T. P. Treuil* |

| | | **A few results on the complexity of classes of identifiable recursive function sets** - *R. Klette* |

| | | **On Limit Identification of Minimal Gödel Numbers for Functions from Enumerable Classes** - *E. B. Kinber* |

| | | **A note on the k-tail method of tree grammar inference** - *J. M. Brayer and K. S. Fu* |

| | | **Zur Untersuchung von Abstrakten Interaktiven Erkennungssystemen** - *H. Jung* |

| | | **Rekursionstheoretische Charakterisierung von erkennbaren Klassen rekursiver Funktionen** - *R. Wiehagen and H. Jung* |

| | | **Grammar enumeration and inference** - *R. M. Wharton* |

| | | **Induction, Pure and Simple** - *P. Kugel* |

| | | **Query-by-Example: a data base language** - *M. Zloof* |

| | | **A class of synthesizeable LISP programs** - *D. R. Smith* |

| | | **An Adaptive Optimal Controller for Discrete-Time Markov Environments** - *I. H. Witten* |

| | | **Syntactic Pattern Recognition, Applications** - *K. S. Fu* |

| | | **Maximum-likelihood from Incomplete Data via the EM Algorithm** - *A. P. Dempster, N. M. Laird and D. B Rubin* |

| | | **Probabilistic Program Synthesis** - *K. Podnieks* |

| | | **Total complexity and the inference of best programs** - *J. A. Feldman and P. Shields* |

| | | **The hierarchical synthesis of LISP scanning functions** - *A. W. Biermann and D. R. Smith* |

| | | **On the inference of optimal descriptions** - *R. Daley* |

| | | **Inference of finite-state probabilistic grammars** - *F. J. Maryanski and T. L. Booth* |

| | | **Limit Identification of Minimal Gödel Numbers** - *R. Freivalds and E. B. Kinber* |

| | | **Algorithms for producing grammars from sample derivations: a common problem of formal language theory and developmental biology** - *H. Feliciangeli and G. Herman* |

| | | **Inductive Inference of Automata, Functions and Programs** - *J. M. Barzdin* |

| | | **On a Theory of Inductive Inference** - *E. B. Kinber* |

| 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* |