Search
Now showing items 1-1 of 1
The Emptiness Problem for Automata on Infinite Trees
(1972-06)
The purpose of this paper is to give an alternative proof to the decidability of the emptiness problem for tree automata, as shown in Rabin [4]. The proof reduces the emptiness problem for automata on infinite trees to ...