We are experiencing minor difficulties with our submission forms, which we are working to resolve. If you have any issues while submitting items, please contact us at dspace-lib@mit.edu.

The Emptiness Problem for Automata on Infinite Trees

Thumbnail Image
Download
Name

MIT-LCS-TM-029.pdf

Size

601.73 KB

Format

Adobe PDF

Checksum (MD5)

84f3928c83c3c8660fe50b80969471fc

Author(s)
Hossley, Robert
•
Rackoff, Charles
Date Issued
June 1972
Series/Report no.
MIT-LCS-TM-029
MAC-TM-029
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 Rabin [4]. 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-genarable trees.
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.