A. Blumensath, Recognisability for algebras of infinite trees, Theoretical Computer Science, vol.412, issue.29, pp.3463-3486, 2011.
DOI : 10.1016/j.tcs.2011.02.037

M. Bojanczyk, H. Straubing, and I. Walukiewicz, Wreath Products of Forest Algebras, with Applications to Tree Logics, 2009 24th Annual IEEE Symposium on Logic In Computer Science, p.2012
DOI : 10.1109/LICS.2009.40
URL : https://hal.archives-ouvertes.fr/hal-00404783

M. Boja?czyk and I. Walukiewicz, Forest algebras, Logic and Automata, pp.107-132, 2008.

C. Cornock and V. Gould, Proper two-sided restriction semigroups and partial actions, Journal of Pure and Applied Algebra, vol.216, issue.4, pp.935-949, 2012.
DOI : 10.1016/j.jpaa.2011.10.015
URL : http://dx.doi.org/10.1016/j.jpaa.2011.10.015

Z. Ésik and P. Weil, On logically defined recognizable tree languages, In Found. of Soft. Techno. and Theoretical Computer Science (FSTTCS), pp.195-207, 2003.

D. Janin, Quasi-recognizable vs MSO definable languages of one-dimensional overlaping tiles, Mathematical Foundations of Computer Science (MFCS), pp.516-528, 2012.
DOI : 10.1007/978-3-642-32589-2_46

D. Janin, Walking Automata in Free Inverse Monoids, LaBRI, 2012.
DOI : 10.1007/978-3-662-49192-8_26
URL : https://hal.archives-ouvertes.fr/hal-00738793

D. Janin, On Languages of One-Dimensional Overlapping Tiles, International Conference on Current Trends in Theory and Practice of Computer Science (SOF- SEM), pp.244-256, 2013.
DOI : 10.1007/978-3-642-35843-2_22
URL : https://hal.archives-ouvertes.fr/hal-00659202

D. Janin, Overlaping tile automata, 8th International Computer Science Symposium in Russia (CSR), pp.431-443, 2013.
DOI : 10.1007/978-3-642-38536-0_37

J. Kellendonk and M. V. Lawson, Tiling Semigroups, Journal of Algebra, vol.224, issue.1, pp.140-150, 2000.
DOI : 10.1006/jabr.1999.8120
URL : http://doi.org/10.1006/jabr.1999.8120

M. V. Lawson, McAlister Semigroups, Journal of Algebra, vol.202, issue.1, pp.276-294, 1998.
DOI : 10.1006/jabr.1997.7301
URL : http://doi.org/10.1006/jabr.1997.7301

D. Perrin and J. Pin, Semigroups and Automata on Infinite Words, Semigroups, Formal Languages and Groups, NATO Advanced Study Institute, pp.49-72, 1995.
DOI : 10.1007/978-94-011-0149-3_3

J. Pin, Relational morphisms, transductions and operations on languages, Formal Properties of Finite Automata and Applications, pp.34-55, 1989.
DOI : 10.1007/BFb0013110

J. Pin, Finite Semigroups and Recognizable Languages: An Introduction, Semigroups, Formal Languages and Groups, NATO Advanced Study Institute, pp.1-32, 1995.
DOI : 10.1007/978-94-011-0149-3_1

J. E. Pin, Chap. 10. Syntactic semigroups, Handbook of formal languages, pp.679-746, 1997.
URL : https://hal.archives-ouvertes.fr/hal-00143940

H. E. Scheiblich, Free inverse semigroups, Semigroup Forum, vol.70, issue.No. 3, pp.351-359, 1972.
DOI : 10.1007/BF02570809

S. Shelah, The Monadic Theory of Order, The Annals of Mathematics, vol.102, issue.3, pp.379-419, 1975.
DOI : 10.2307/1971037

W. Thomas, Chap. 7. Languages, automata, and logic, Handbook of Formal Languages, pp.389-455, 1997.
URL : https://hal.archives-ouvertes.fr/hal-01117513

T. Wilke, AN ALGEBRAIC THEORY FOR REGULAR LANGUAGES OF FINITE AND INFINITE WORDS, International Journal of Algebra and Computation, vol.03, issue.04, pp.447-489, 1993.
DOI : 10.1142/S0218196793000287