The Emptiness Problem for Automata on Infinite Trees
MASSACHUSETTS INST OF TECH CAMBRIDGE PROJECT MAC
Pagination or Media Count:
The purpose of the paper is to give an alternative proof to the decidability of the emptiness problem for tree automata, as shown in another paper. 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.
- Theoretical Mathematics