A. Arnold, A syntactic congruence for rational ??-languages, Theoretical Computer Science, vol.39, pp.333-335, 1985.
DOI : 10.1016/0304-3975(85)90148-3
URL : https://doi.org/10.1016/0304-3975(85)90148-3

J. R. Büchi, Weak second-order arithmetic and finite automata, Zeitschrift für mathematische Logik und Grundlagen der Mathematik, pp.66-92, 1960.

M. Chrobak, Finite automata and unary languages, Theoretical Computer Science, vol.47, issue.2, pp.149-158, 1986.
DOI : 10.1016/0304-3975(86)90142-8
URL : https://doi.org/10.1016/0304-3975(86)90142-8

H. M. Devadze, Generating sets of the semigroup of all binary relations in a finite set, Doklady Akademii Nauk BSSR, vol.12, pp.765-768, 1968.

L. Fleischer and M. Kufleitner, Efficient Algorithms for Morphisms over Omega- Regular Languages, FSTTCS 2015, Proceedings, volume 45 of LIPIcs, pp.112-124, 2015.

M. Holzer and B. König, On deterministic finite automata and syntactic monoid size, Theoretical Computer Science, vol.327, issue.3, pp.319-347, 2004.
DOI : 10.1016/j.tcs.2004.04.010
URL : https://doi.org/10.1016/j.tcs.2004.04.010

K. H. Kim and F. W. Roush, Two-generator semigroups of binary relations, Journal of Mathematical Psychology, vol.17, issue.3, pp.236-246, 1978.
DOI : 10.1016/0022-2496(78)90018-4

J. Konieczny, A proof of Devadze???s theorem on generators of the semigroup of Boolean matrices, Semigroup Forum, vol.61, issue.2, pp.281-288, 2011.
DOI : 10.1007/BF02194925

J. Pécuchet, Varietes de Semis Groupes et Mots Infinis, STACS 1986, Proceedings, pp.180-191, 1986.
DOI : 10.1007/3-540-16078-7_75

D. Perrin and J. Pin, Infinite words, Pure and Applied Mathematics, vol.141, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00620767

J. Pin, Varieties of Formal Languages, North Oxford Academic, 1986.
DOI : 10.1007/978-1-4613-2215-3

W. J. Sakoda and M. Sipser, Nondeterminism and the size of two way finite automata, Proceedings of the tenth annual ACM symposium on Theory of computing , STOC '78, pp.275-286, 1978.
DOI : 10.1145/800133.804357

W. Thomas, Automata on Infinite Objects, Handbook of Theoretical Computer Science, pp.133-191, 1990.
DOI : 10.1016/B978-0-444-88074-1.50009-3

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