Richard Büchi (1966):
Symposium on Decision Problems: On a Decision Method in Restricted Second Order Arithmetic.
In: Logic, Methodology and Philosophy of Science, Proceeding of the 1960 International Congress,
Studies in Logic and the Foundations of Mathematics 44.
Elsevier,
pp. 1–11,
doi:10.1016/S0049-237X(09)70564-6.
Yang Cai & Ting Zhang (2011):
A Tight Lower Bound for Streett Complementation.
In: Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011),
pp. 339–350,
doi:10.4230/LIPIcs.FSTTCS.2011.339.
Yang Cai & Ting Zhang (2011):
Tight Upper Bounds for Streett and Parity Complementation.
In: Proceedings of the 20th Conference on Computer Science Logic (CSL 2011).
Dagstuhl Publishing,
pp. 112–128,
doi:10.4230/LIPIcs.CSL.2011.112.
Yang Cai, Ting Zhang & Haifeng Luo (2009):
An Improved Lower Bound for the Complementation of Rabin Automata.
In: Proceedings of the 24th Annual IEEE Symposium on Logic In Computer Science.
IEEE Computer Society,
pp. 167–176,
doi:10.1109/LICS.2009.13.
Yaacov Choueka (1974):
Theories of automata on ω-types: a simplified appraoch.
Journal of Computer and System Science 8(2),
pp. 117–141,
doi:10.1016/S0022-0000(74)80051-6.
Thomas Colcombet & Konrad Zdanowski (2009):
A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata.
In: Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming (ICALP 2009).
Springer-Verlag,
pp. 151–162,
doi:10.1007/978-3-642-02930-1_13.
Nissim Francez (1986):
Fairness.
Springer-Verlag New York, Inc..
Nissim Francez & Dexter Kozen (1984):
Generalized fair termination.
In: Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages (POPL'84).
ACM,
pp. 46–53,
doi:10.1145/800017.800515.
Yuri Gurevich & Leo Harrington (1982):
Trees, Automata, and Games.
In: Proceedings of the 14th annual ACM symposium on Theory of computing (STOC'82),
pp. 60–65,
doi:10.1145/800070.802177.
Orna Kupferman & Moshe Y. Vardi (2005):
Complementation Constructions for Nondeterministic Automata on Infinite Words.
In: Tools and Algorithms for the Construction and Analysis of Systems,
Lecture Notes in Computer Science 3440.
Springer Berlin / Heidelberg,
pp. 206–221,
doi:10.1007/978-3-540-31980-1_14.
Christof Löding (1999):
Optimal Bounds for Transformations of omega-Automata.
In: Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science.
Springer-Verlag,
pp. 97–109,
doi:10.1007/3-540-46691-6_8.
Robert McNaughton (1966):
Testing and Generating Infinite Sequences by a Finite Automaton.
Information and Control 9(5),
pp. 521–530,
doi:10.1016/S0019-9958(66)80013-X.
M. Michel (1988):
Complementation is more difficult with automata on infinite words.
CNET.
David E. Muller & Paul E. Schupp (1995):
Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra.
Theoretical Computer Science 141(1-2),
pp. 69–107,
doi:10.1016/0304-3975(94)00214-4.
N. Piterman (2006):
From Nondeterministic Buchi and Streett Automata to Deterministic Parity Automata.
In: 21st Annual IEEE Symposium on Logic in Computer Science,
pp. 255–264,
doi:10.1109/LICS.2006.28.
M. O. Rabin & D. Scott (1959):
Finite automata and their decision problems.
IBM Journal of Research and Development 3,
pp. 114–125,
doi:10.1147/rd.32.0114.
S. Safra (1988):
On the complexity of omega -automata.
In: Proceedings of the 29th Annual Symposium on Foundations of Computer Science.
IEEE Computer Society,
pp. 319–327,
doi:10.1109/SFCS.1988.21948.
S. Safra & M. Y. Vardi (1989):
On ω-automata and temporal logic.
In: Proceedings of the 21st annual ACM symposium on Theory of computing (STOC'89).
ACM,
pp. 127–137,
doi:10.1145/73007.73019.
Shmuel Safra (1992):
Exponential Determinization for omega-Automata with Strong-Fairness Acceptance Condition (Extended Abstract).
In: Proceedings of the 24th annual ACM symposium on Theory of computing (STOC'92),
pp. 275–282,
doi:10.1145/129712.129739.
Sven Schewe (2009):
Büchi Complementation Made Tight.
In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS 2009),
pp. 661–672,
doi:10.4230/LIPIcs.STACS.2009.1854.
Sven Schewe (2009):
Tighter Bounds for the Determinization of Büchi Automata.
In: Proceedings of the 12th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2009),
pp. 167–181.
Stefan Schwoon (2002):
Determinization and Complementation of Streett Automata.
In: Automata Logics, and Infinite Games,
Lecture Notes in Computer Science 2500.
Springer Berlin / Heidelberg,
pp. 257–264,
doi:10.1007/3-540-36387-4_5.
Moshe Y. Vardi (2007):
The Büchi complementation saga.
In: Proceedings of the 24th International Symposium on Theoretical Aspects of Computer Science (STACS 2007).
Springer-Verlag,
pp. 12–22,
doi:10.1007/978-3-540-70918-3_2.
Qiqi Yan (2006):
Lower Bounds for Complementation of ω-Automata Via the Full Automata Technique.
In: Proceedings of the 33rd Internatilonal Collogquium on Automata, Languages and Programming (ICALP 2006),
pp. 589–600,
doi:10.1007/11787006_50.
eptcs@eptcs.org