A class of LISP programs that is analogous to the finite-state automata is defined, and an algorithm is given for constructing such programs from examples of their input-output behavior. It is shown that the algorithm has robust performance for a wide variety of inputs and that it converges to a solution on the basis of minimum input information.
No takes yet. Share an insight, caveat, or question.
Alan W. Biermann (1978) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: