AbstractIn this paper we consider several types of equations on words, motivated by the attempt of characterizing the class of polyominoes that tile the plane by translation in two distinct ways. Words coding the boundary of these polyominoes satisfy an equation whose solutions are in bijection with a subset of the solutions of equations of the form ABA˜B˜≡XYX˜Y˜. It turns out that the solutions are strongly related to local periodicity involving palindromes and conjugate words
AbstractOn square or hexagonal lattices, tiles or polyominoes are coded by words. The polyominoes th...
The characterization of the structure of palindromic regular and palindromic context-free languages ...
AbstractWe study the relation between the palindromic and factor complexity of infinite words. We sh...
AbstractIn this paper we consider several types of equations on words, motivated by the attempt of c...
Dans cette thèse, différents problèmes de la combinatoire des mots et de géométrie discrète sont con...
In this thesis, we explore different problems at the intersection of combinatorics on words and disc...
AbstractWe give a characterization of the palindromes in a class of infinite words over Σ={1,2} rela...
AbstractIn this paper we prove that for any infinite word w whose set of factors is closed under rev...
International audienceIn 1999 Lyngsø and Pedersen proposed a conjecture stating that every binary ci...
AbstractWe study the palindromic complexity of infinite words obtained by coding rotations on partit...
AbstractIt has been proved that, among the polyominoes that tile the plane by translation, the so-ca...
AbstractWe describe some combinatorial properties of an intriguing class of infinite words, called s...
In this paper we prove that for any infinite word w whose set of factors is closed under reversal. t...
It has been proved that, among the polyominoes that tile the plane by translation, the so-called squ...
International audienceWe study the palindromic complexity of infinite words obtained by coding rotat...
AbstractOn square or hexagonal lattices, tiles or polyominoes are coded by words. The polyominoes th...
The characterization of the structure of palindromic regular and palindromic context-free languages ...
AbstractWe study the relation between the palindromic and factor complexity of infinite words. We sh...
AbstractIn this paper we consider several types of equations on words, motivated by the attempt of c...
Dans cette thèse, différents problèmes de la combinatoire des mots et de géométrie discrète sont con...
In this thesis, we explore different problems at the intersection of combinatorics on words and disc...
AbstractWe give a characterization of the palindromes in a class of infinite words over Σ={1,2} rela...
AbstractIn this paper we prove that for any infinite word w whose set of factors is closed under rev...
International audienceIn 1999 Lyngsø and Pedersen proposed a conjecture stating that every binary ci...
AbstractWe study the palindromic complexity of infinite words obtained by coding rotations on partit...
AbstractIt has been proved that, among the polyominoes that tile the plane by translation, the so-ca...
AbstractWe describe some combinatorial properties of an intriguing class of infinite words, called s...
In this paper we prove that for any infinite word w whose set of factors is closed under reversal. t...
It has been proved that, among the polyominoes that tile the plane by translation, the so-called squ...
International audienceWe study the palindromic complexity of infinite words obtained by coding rotat...
AbstractOn square or hexagonal lattices, tiles or polyominoes are coded by words. The polyominoes th...
The characterization of the structure of palindromic regular and palindromic context-free languages ...
AbstractWe study the relation between the palindromic and factor complexity of infinite words. We sh...