Nondeterministic Tree Automata
The automaton models introduced so far mainly differ in their acceptance conditions. However, they all consume infinite sequences of alphabet symbols, i.e., they consume ω-words. We therefore call these automata word automata. In this chapter we define finite-state automata which process infinite trees instead of infinite words and consequently we call them tree automata.
Unable to display preview. Download preview PDF.