A Sequential Algorithm for the Synthesis of Tree Automata

The paper deals with the synthesis problem for tree automata. A sequential synthesis algorithm is presented based on the hypothesis formulation-verification-modification scheme.

[1]  Taylor L. Booth,et al.  Sequential machines and automata theory , 1967 .

[2]  King-Sun Fu,et al.  Syntactic Pattern Recognition And Applications , 1968 .

[3]  Alan W. Biermann,et al.  The Inference of Regular LISP Programs from Examples , 1978, IEEE Transactions on Systems, Man, and Cybernetics.

[4]  L. P. J. Veelenturf,et al.  Inference of Sequential Machines from Sample Computations , 1978, IEEE Transactions on Computers.

[5]  Marc Richetin,et al.  Sequential learning of automata from input-output behaviour , 1983, Robotica.

[6]  Walter S. Brainerd,et al.  Tree Generating Regular Systems , 1969, Inf. Control..

[7]  K. S. Fu.  INFERENCE OF HIGH DIMENSIONAL GRAMMARS , 1978 .

[8]  Derick Wood,et al.  Systolic Tree Acceptors , 1984, RAIRO Theor. Informatics Appl..