Title :
The emptiness problem for automata on infinite trees
Author :
Hossley, R. ; Rackoff, C.
Abstract :
The purpose of this paper is to give an alternative proof to the decidability of the emptiness problem for tree automata, as shown in Rabin4. The proof reduces the emptiness problem for automata on infinite trees to that for automata on finite trees, by showing that any automata definable set of infinite trees must contain a finitely-generable tree.
Keywords :
Automata; Binary trees; Contracts; US Government; Visualization;
Conference_Titel :
Switching and Automata Theory, 1972., IEEE Conference Record of 13th Annual Symposium on
Conference_Location :
USA
DOI :
10.1109/SWAT.1972.28
