M. Boja?czyk, Tree-Walking Automata, 2nd Int. Conf. on Language and Automata Theory and Applications (LATA), 2008.
DOI : 10.1007/978-3-540-88282-4_1

M. Boja?czyk and T. Colcombet, Tree-Walking Automata Do Not Recognize All Regular Languages, STOC. ACM, 2005.
DOI : 10.1137/050645427

M. Boja?czyk, M. Samuelides, T. Schwentick, and L. Segoufin, Expressive Power of Pebble Automata, In Int. Col. on Aut., Lang. and Programming, 2006.
DOI : 10.1007/11786986_15

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, Two-way Automata and Regular Languages of Overlapping Tiles, Fundamenta Informaticae, vol.141, issue.4, pp.1-33, 2015.
DOI : 10.3233/FI-2015-1278
URL : https://hal.archives-ouvertes.fr/hal-00717572

J. Engelfriet, H. J. Hoogeboom, and B. Samwel, XML transformation by treewalking transducers with invisible pebbles, Principles of Database System (PODS), 2007.

J. Engelfriet and H. J. Hoogeboom, Nested Pebbles and Transitive Closure, Symp. on Theor. Aspects of Computer Science (STACS), 2006.
DOI : 10.1007/11672142_39

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, 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, Towards a Higher-Dimensional String Theory for the Modeling of Computerized Systems, Int. Conf. on Current Trends in Theo. and Prac. of Comp, pp.7-20, 2014.
DOI : 10.1007/978-3-319-04298-5_2
URL : https://hal.archives-ouvertes.fr/hal-00879463

D. Janin, Inverse Monoids of Higher-Dimensional Strings, In Int. Col. on Theor. Aspects of Comp. (ICTAC) LNCS, vol.9399, 2015.
DOI : 10.1007/978-3-319-25150-9_9
URL : https://hal.archives-ouvertes.fr/hal-01165724

D. Janin, Algebras, Automata and Logic for Languages of Labeled Birooted Trees, Information and Computation, vol.243, pp.222-248, 2015.
DOI : 10.1007/978-3-642-39212-2_29
URL : https://hal.archives-ouvertes.fr/hal-00784898

S. W. Margolis and J. C. Meakin, E-unitary inverse monoids and the Cayley graph of a group presentation, Journal of Pure and Applied Algebra, vol.58, issue.1, pp.46-76, 1989.
DOI : 10.1016/0022-4049(89)90052-2

J. Meakin, Groups and semigroups: connections and contrasts Lecture Note Series 340, Groups St Andrews 2005, 2007.

R. Milner, Communication and concurrency, 1989.

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

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

J. B. Stephen, Presentations of inverse monoids, Journal of Pure and Applied Algebra, vol.63, issue.1, pp.81-112, 1990.
DOI : 10.1016/0022-4049(90)90057-O