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