Tree Automata and Logic Programs

Each clause of a definite sentence can be read as a move of a tree automaton. These tree automata, called pattern replacing automata (PRA), are introduced and studied in this paper.

[1]  Jeffrey D. Ullman,et al.  Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.

[2]  Krzysztof R. Apt,et al.  Contributions to the Theory of Logic Programming , 1982, JACM.