F. S. Almeida, Algebraic Aspects of Tiling Semigroups, 2010.

M. Anselmo, Automates et codes zigzag, RAIRO - Theoretical Informatics and Applications, vol.25, issue.1, pp.49-66, 1991.
DOI : 10.1051/ita/1991250100491
URL : http://archive.numdam.org/article/ITA_1991__25_1_49_0.pdf

J. Berstel, Transductions and Context-Free Languages, 1979.
DOI : 10.1007/978-3-663-09367-1
URL : https://hal.archives-ouvertes.fr/hal-00619779

F. Berthaut, D. Janin, and B. Martin, ADVANCED SYNCHRONIZATION OF AUDIO OR SYMBOLIC MUSICAL PATTERNS: AN ALGEBRAIC APPROACH, International Journal of Semantic Computing, vol.06, issue.04, pp.409-427
DOI : 10.1142/S1793351X12400132
URL : https://hal.archives-ouvertes.fr/hal-00698963

J. Birget, Concatenation of inputs in a two-way automaton, Theoretical Computer Science, vol.63, issue.2, pp.141-156, 1989.
DOI : 10.1016/0304-3975(89)90075-3

B. Courcelle and J. Engelfriet, Graph structure and monadic second-order logic, a language theoretic approach, volume 138 of Encyclopedia of mathematics and its applications, 2012.

A. Dicky and D. Janin, Embedding Finite and Infinite Words into Overlapping Tiles, Developments in Language Theory (DLT), pp.339-347, 2014.
DOI : 10.1007/978-3-319-09698-8_30
URL : https://hal.archives-ouvertes.fr/hal-00910002

L. Do, B. Van, I. Lesaëc, and . Litovsky, On coding morphisms for zigzag codes, ITA, vol.26, pp.565-580, 1992.

E. Dubourg and D. Janin, Algebraic Tools for the Overlapping Tile Product, Language and Automata Theory and Applications (LATA), pp.335-346, 2014.
DOI : 10.1007/978-3-319-04921-2_27
URL : https://hal.archives-ouvertes.fr/hal-00879465

J. Engelfriet, H. J. Hoogeboom, and J. Van-best, Trips on trees, Acta Cybern, vol.14, issue.1, pp.51-64, 1999.

J. Engelfriet, H. J. Hoogeboom, and B. Samwel, XML transformation by tree-walking transducers with invisible pebbles, Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '07, 2007.
DOI : 10.1145/1265530.1265540

J. Engelfriet and H. J. Hoogeboom, Tree-Walking Pebble Automata, Jewels are forever, contributions to Theoretical Computer Science in honor of Arto Salomaa, pp.72-83, 1999.
DOI : 10.1007/978-3-642-60207-8_7

J. Engelfriet and H. J. Hoogeboom, Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure, Logical Methods in Computer Science, vol.3, issue.2, 2007.
DOI : 10.2168/LMCS-3(2:3)2007

J. Fountain, G. Gomes, and V. Gould, THE FREE AMPLE MONOID, International Journal of Algebra and Computation, vol.19, issue.04, pp.527-554, 2009.
DOI : 10.1142/S0218196709005214

S. Fratani and G. Sénizergues, Iterated pushdown automata and sequences of rational numbers, Annals of Pure and Applied Logic, vol.141, issue.3, pp.363-411, 2006.
DOI : 10.1016/j.apal.2005.12.004
URL : https://hal.archives-ouvertes.fr/hal-00368254

V. Geffert and L. Istonová, Translation from classical two-way automata to pebble two-way automata . RAIRO -Theor, Inf. and Applic, vol.44, issue.4, pp.507-523, 2010.

N. Globerman and D. Harel, Complexity results for two-way and multi-pebble automata and their logics, Theoretical Computer Science, vol.169, issue.2, pp.161-184, 1996.
DOI : 10.1016/S0304-3975(96)00119-3

P. Hudak and D. Janin, Tiled polymorphic temporal media, Proceedings of the 2nd ACM SIGPLAN international workshop on Functional art, music, modeling & design, FARM '14, pp.49-60, 2014.
DOI : 10.1145/2633638.2633649
URL : https://hal.archives-ouvertes.fr/hal-00955113

D. Janin, Quasi-inverse monoids (and premorphisms) Research report RR-1459-12, LaBRI, p.2012

D. Janin, Quasi-recognizable vs MSO Definable Languages of One-Dimensional Overlapping Tiles, Mathematical Found. of Comp. Science (MFCS), pp.516-528, 2012.
DOI : 10.1007/978-3-642-32589-2_46
URL : https://hal.archives-ouvertes.fr/hal-00671917

D. Janin, Vers une modélisation combinatoire des structures rythmiques simples de la musique, Revue Francophone d'Informatique Musicale (RFIM), 2012.

D. Janin, Algebras, Automata and Logic for Languages of Labeled Birooted Trees, In Int. Col. on Aut., Lang. and Programming LNCS, vol.7966, pp.318-329, 2013.
DOI : 10.1007/978-3-642-39212-2_29
URL : https://hal.archives-ouvertes.fr/hal-00784898

D. Janin, On Languages of One-Dimensional Overlapping Tiles, Int. Conf. on Current Trends in Theo. and Prac. of Comp, 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 Int, pp.431-443, 2013.

D. Janin, On languages of labeled birooted trees: Algebras, automata and logic. Information and Computation, 2014.

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

D. Janin, F. Berthaut, and M. Desainte-catherine, Multi-scale design of interactive music systems : the libTuiles experiment, Sound and Music Comp. (SMC), 2013.
URL : https://hal.archives-ouvertes.fr/hal-00813313

D. Janin, F. Berthaut, M. Desainte-catherine, Y. Orlarey, and S. Salvati, The T-calculus, Proceedings of the first ACM SIGPLAN workshop on Functional art, music, modeling & design, FARM '13, pp.23-34, 2013.
DOI : 10.1145/2505341.2505347
URL : https://hal.archives-ouvertes.fr/hal-00789189

J. Kellendonk, The Local Structure of Tilings and Their Integer Group of Coinvariants, Communications in Mathematical Physics, vol.187, issue.1, pp.115-157, 1997.
DOI : 10.1007/s002200050131

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

J. Kellendonk and M. V. Lawson, Universal groups for point-sets and tilings, Journal of Algebra, vol.276, issue.2, pp.462-492, 2004.
DOI : 10.1016/j.jalgebra.2004.01.029

M. Kunc and A. Okhotin, Describing Periodicity in Two-Way Deterministic Finite Automata Using Transformation Semigroups, Developments in Language Theory (DLT), pp.324-336, 2011.
DOI : 10.1007/978-3-642-22321-1_28

M. V. Lawson, Inverse Semigroups : The theory of partial symmetries, World Scientific, 1998.
DOI : 10.1142/3645

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

B. Lesaëc, I. Litovsky, and B. Patrou, A more efficient notion of zigzag stability, ITA, vol.30, issue.3, pp.181-194, 1996.

S. W. Margolis and J. Pin, Languages and inverse semigroups, In Int. Col. on Aut., Lang. and Programming LNCS, vol.172, pp.337-346, 1984.
DOI : 10.1007/3-540-13345-3_30

D. B. Mcalister, Inverse semigroups which are separated over a subsemigroup, Transactions of the American Mathematical Society, vol.182, pp.85-117, 1973.
DOI : 10.1090/S0002-9947-1973-0327952-0

W. D. Munn, Free inverse semigroups, Proceeedings of the London Mathematical Society, vol.29, issue.3, pp.385-404, 1974.

J. Pécuchet, Automates boustrophedon, semi-groupe de Birget et mono??de inversif libre, RAIRO. Informatique th??orique, vol.19, issue.1, pp.71-100, 1985.
DOI : 10.1051/ita/1985190100711

M. Petrich, Inverse semigroups, Semigroup Forum, vol.32, issue.1, 1984.
DOI : 10.1007/BF02575538

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

M. O. Rabin and D. Scott, Finite Automata and Their Decision Problems, IBM Journal of Research and Development, vol.3, issue.2, pp.114-125, 1959.
DOI : 10.1147/rd.32.0114
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.88.4472

J. Sakarovitch, Elements of Automata Theory, 2009.
DOI : 10.1017/CBO9781139195218

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

J. C. Shepherdson, The Reduction of Two-Way Automata to One-Way Automata, IBM Journal of Research and Development, vol.3, issue.2, pp.198-200, 1959.
DOI : 10.1147/rd.32.0198

P. V. Silva, On free inverse monoid languages, RAIRO - Theoretical Informatics and Applications, vol.30, issue.4, pp.349-378, 1996.
DOI : 10.1051/ita/1996300403491

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

M. Y. Vardi, A note on the reduction of two-way automata to one-way automata, Information Processing Letters, vol.30, issue.5, pp.261-264, 1989.
DOI : 10.1016/0020-0190(89)90205-6

D. J. Weir, Characterizing mildly context-sensitive grammar formalisms, 1988.