A tighter analysis of Piterman's Büchi determinization
References (9)
Testing and generating infinite sequences by a finite automaton
Information and Computation
(1966)- et al.
Büchi complementation made tighter
Optimal bounds for transformations of omega-automata
- Max Michel, Complementation is more difficult with automata on infinite words, Technical report, CNET, Paris,...
There are more references available in the full text version of this article.
Cited by (12)
Divide-and-Conquer Determinization of Büchi Automata Based on SCC Decomposition
2022, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)Inherent size blowup in ω-automata
2019, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)Permutation games for the weakly aconjunctive μ -calculus
2018, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)Rabin vs. Streett automata
2018, Leibniz International Proceedings in Informatics, LIPIcs
Copyright © 2009 Elsevier B.V. All rights reserved.