Goto

Collaborating Authors

Information Technology





The Inference of Regular LISP Programs from Examples

Classics

—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.IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS, VOL. SMC-8, NO. 8,




A knowledge-based computer vision system

Classics

In A. Hanson and E. Riseman (Eds.), Computer vision systems. New York: Academic Press, 335-352.