DocumentCode :
1164655
Title :
The Inference of Regular LISP Programs from Examples
Author :
Biermann, Alan W.
Volume :
8
Issue :
8
fYear :
1978
Firstpage :
585
Lastpage :
600
Abstract :
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.
Keywords :
Automata; Computer languages; Computer science; Inference algorithms; Information resources; Programming profession; Robustness; Testing;
fLanguage :
English
Journal_Title :
Systems, Man and Cybernetics, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9472
Type :
jour
DOI :
10.1109/TSMC.1978.4310035
Filename :
4310035
Link To Document :
بازگشت