The Emptiness and Complementation Problems for Automata on Infinite Trees
Name
MIT-LCS-TR-106.pdf
Size
1.4 MB
Format
Adobe PDF
Checksum (MD5)
bb6b91a8510c06d17d2bee75307fbc48
Author(s)
Rackoff, Charles Weill
Advisor(s)
Rogers, Hartley
Date Issued
January 1973
Series/Report no.
MIT-LCS-TR-106
MAC-TR-106
Abstract
In [6] Rabin defines Automata on Infinite Trees, and the body of that paper is concerned with proving two theorems about these automata. The result we consider in the first chapter says that there exists an effective procedure to determine, given an automaton on infinite trees, whether or not it accepts anything at all. We present a new decision procedure which is much simpler than Rabin's since we do not use an induction argument as he does.
Persistent DSpace Link
