On &ohgr;-automata and temporal logic
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Languages, automata, and logic
Handbook of formal languages, vol. 3
How much memory is needed to win infinite games?
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
On the complexity of omega -automata
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Infinite sequences and finite machines
SWCT '63 Proceedings of the 1963 Proceedings of the Fourth Annual Symposium on Switching Circuit Theory and Logical Design
Complexity of Topological Properties of Regular ω-Languages
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
On Minimal Odd Rankings for Büchi Complementation
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Alternation removal in büchi automata
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Lower bounds for complementation of ω-automata via the full automata technique
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
A new algorithm for strategy synthesis in LTL games
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
On the succinctness of nondeterminism
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Experiments with deterministic ω-automata for formulas of linear temporal logic
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Observations on determinization of büchi automata
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Translating to Co-Büchi Made Tight, Unified, and Useful
ACM Transactions on Computational Logic (TOCL)
Complexity of Topological Properties of Regular ω-Languages
Fundamenta Informaticae
| Hi-index | 0.00 |
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, Jurdzinski, and Walukiewicz (1997), we obtain sharplo wer bounds on the size of the constructed automata.