Abstract
In this paper we settle the complexity of some basic constructions of ω-automata theory, concerning transformations of automata characterizing the set of ω-regular languages. In particular we consider Safra’s construction (for the conversion of nondeterministic Büchi automata into deterministic Rabin automata) and the appearance record constructions (for the transformation between different models of deterministic automata with various acceptance conditions). Extending results of Michel (1988) and Dziembowski, Jurdziński, and Walukiewicz (1997), we obtain sharplo wer bounds on the size of the constructed automata. © Springer-Verlag Berlin Heidelberg 1999.
Cite
CITATION STYLE
Löding, C. (1999). Optimal bounds for transformations of ω-automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1738, pp. 97–109). Springer Verlag. https://doi.org/10.1007/3-540-46691-6_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
