| dc.contributor.author | Hossley, Robert | en_US |
| dc.contributor.author | Rackoff, Charles | en_US |
| dc.date.accessioned | 2023-03-29T14:02:56Z | |
| dc.date.available | 2023-03-29T14:02:56Z | |
| dc.date.issued | 1972-06 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/148858 | |
| dc.description.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. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TM-029 | |
| dc.relation.ispartofseries | MAC-TM-029 | |
| dc.title | The Emptiness Problem for Automata on Infinite Trees | en_US |
| dc.identifier.oclc | 09913094 | |
