J. and R. Büchi, On a Decision Method in Restricted Second Order Arithmetic, Proceedings of the International Congress on Logic, Methodology, and Philosophy of Science, pp.1-11, 1960.
DOI : 10.1007/978-1-4613-8928-6_23

E. Friedgut, O. Kupferman, and M. Y. Vardi, B??CHI COMPLEMENTATION MADE TIGHTER, International Journal of Foundations of Computer Science, vol.17, issue.04, pp.851-867, 2006.
DOI : 10.1142/S0129054106004145
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.106.514

S. Gurumurthy, O. Kupferman, F. Somenzi, and M. Y. Vardi, On Complementing Nondeterministic B??chi Automata, Proceedings of the 12th Advanced Research Working Conference on Correct Hardware Design and Verification Methods (CHARME 2003), 21?24 October, pp.96-110, 2003.
DOI : 10.1007/978-3-540-39724-3_10

P. Robert, . Kurshan, M. Y. Kupferman, and . Vardi, Computer-aided verification of coordinating processes: the automata-theoretic approach Weak alternating automata are not that weak, ACM Transactions on Computational Logic, vol.2, issue.2, pp.408-429, 1994.

C. Löding, Optimal Bounds for Transformations of ??-Automata, Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science, pp.13-15, 1999.
DOI : 10.1007/3-540-46691-6_8

M. Michel, Complementation is more difficult with automata on infinite words, 1988.

J. Pécuchet, On the complementation of B??chi automata, Theoretical Computer Science, vol.47, issue.3, pp.95-98, 1986.
DOI : 10.1016/0304-3975(86)90136-2

N. Piterman, From nondeterministic Büchi and Streett automata to deterministic parity automata, Journal of Logical Methods in Computer Science, vol.3, issue.35, 2007.

O. Michael, D. S. Rabin, and . Scott, Finite automata and their decision problems, IBM Journal of Research and Development, vol.3, pp.115-125, 1959.

S. Safra, On the complexity of omega -automata, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science, pp.24-26, 1988.
DOI : 10.1109/SFCS.1988.21948

S. Schewe, Tighter bounds for the determinization of Büchi automata, Proceedings of the Twelfth International Conference on Foundations of Software Science and Computation Structures, pp.22-29, 2009.

J. William, M. Sakoda, and . Sipser, Non-determinism and the size of two-way automata, Proceedings of the 10th Annual ACM Symposium on Theory of Computing, pp.1-3, 1978.

A. P. Sistla, M. Y. Vardi, P. Tsay, Y. Che, M. Tsai et al., The complementation problem for B??chi automata with applications to temporal logic, Proceedings of the 14th International Conference On Tools and Algorithms for the Construction and Analysis of Systems, pp.217-239, 1987.
DOI : 10.1016/0304-3975(87)90008-9

N. M. Temme, Asymptotic Estimates of Stirling Numbers, Studies in Applied Mathematics, vol.XLIII:, issue.3, pp.233-243, 1993.
DOI : 10.1002/sapm1993893233

W. Thomas, Complementation of Büchi automata revisited, Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa, pp.109-122, 1999.

M. Y. Vardi, The Büchi complementation saga, Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, pp.22-24, 2007.

Q. Yan, Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique, Logical Methods in Computer Science, vol.4, issue.1, 2008.
DOI : 10.2168/LMCS-4(1:5)2008