
1978    On the Complexity of Minimum Inference of Regular Sets  D. Angluin 
   Zur Theorie der Algorithmischen Erkennung  R. Wiehagen 
   Modeling By Shortest Data Description  J. Rissanen 
   Inference for Regular Bilanguages  J. Berger and C. Pair 
   Inference of sequential machines from sample computations  L. P. J. Veelenturf 
   Characterization problems in the theory of inductive inference  R. Wiehagen 
   A method for obtaining digital signatures and public key cryptosytems  R. L. Rivest, A. Shamir and L. Adleman 
   Complexitybased induction systems: comparisons and convergence theorems  R. J. Solomonoff 
   Syntactic Pattern Recognition, An Introduction  R. C. Gonzalez and M. G. Thomason 
   The inference of regular LISP programs from examples  A. W. Biermann 
   An interference matching technique for inducing abstractions  F. HayesRoth and J. McDermott 
   Complexity of Automaton Identification from Given Data  E. M. Gold 
   A solution of the syntactical inductioninference problem for regular languages  T. W. Pao 
   A solution of the syntactical inductioninference problem for regular languages  T. W. Pao and J. W. I. Carr 
   On the Connection Between the Complexity and Credibility of Inferred Models  J. Pearl 
   A sane algorithm for the synthesis of LISP functions from example problems  Y. Kodratoff and J. Fargues 
   On the inference of stochastic regular grammars  A. Van der Mude and A. Walker 
   Central Limit Theorems for Empirical Measures  R. M. Dudley 
