A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf
.
Reasoning About Co–Büchi Tree Automata
[chapter]
2005
Lecture Notes in Computer Science
We consider co-Büchi tree automata along with both alternating and generalized paradigms, as a characterization of the class of languages whose complement is accepted by generalized Büchi tree automata. We first prove that for alternating generalized co-Büchi tree automata the simulation theorem does not hold and the generalized acceptance does not add to the expressive power of the model. Then, we show that the emptiness problem for this class is Exptime-complete. For the class of languages
doi:10.1007/978-3-540-31862-0_37
fatcat:xyygpeb3dvgbdawjkest4alnp4