13th Annual Symposium on Switching and Automata Theory (swat 1972)
Download PDF

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.
Like what you’re reading?
Already a member?
Get this article FREE with a new membership!

Related Articles