AbstractA finite non-empty word z is said to be a border of a finite non-empty word w if w=uz=zv for some non-empty words u and v. A finite non-empty word is said to be bordered if it admits a border, and it is said to be unbordered otherwise. In this paper, we give two characterizations of the biinfinite words of the form ωuvuω, where u and v are finite words, in terms of its unbordered factors.The main result of the paper states that the words of the form ωuvuω are precisely the biinfinite words w=⋯a−2a−1a0a1a2⋯ for which there exists a pair (l0,r0) of integers with l0<r0 such that, for every integers l⩽l0 and r⩾r0, the factor al⋯al0⋯ar0⋯ar is a bordered word.The words of the form ωuvuω are also characterized as being those biinfinite wor...
We study word structures of the form (D, <, P) where D is either N or Z, < is the natural linear ord...
peer reviewedGeneralizing the notion of the boundary sequence introduced by Chen and Wen, the $n$th ...
We study word structures of the form (D,<=,P) where D is either N or Z, <= is a linear ordering on D...
A finite non-empty word z is said to be a border of a finite non-empty word w if w=uz=zv for some no...
AbstractA finite non-empty word z is said to be a border of a finite non-empty word w if w=uz=zv for...
AbstractA finite word is called bordered if it has a proper prefix which is also a suffix of that wo...
AbstractWe formulate and prove a defect theorem for bi-infinite words. Let X be a finite set of word...
AbstractA nonempty word β is said to be a border of a word α if and only if α = λβ = βρ for some non...
International audienceIn this paper, we study languages of finite and infinite birooted words. We sh...
Combinatorics on words is a field of mathematics and theoretical computer science that is concerned...
Abstract. The relationship between the length of a word and the maximum length of its unbordered fac...
Bi-infinite words are sequences of characters that are infinite forwards and backwards; for example ...
We study word structures of the form (D,<,P) where D is either the naturals or the integers with the...
AbstractIn this paper, we provide a new characterization of uniformly recurrent words with finite de...
Let $L_{k,\alpha}^{\mathbb{Z}}$ denote the set of all bi-infinite $\alpha$-power free words over an ...
We study word structures of the form (D, <, P) where D is either N or Z, < is the natural linear ord...
peer reviewedGeneralizing the notion of the boundary sequence introduced by Chen and Wen, the $n$th ...
We study word structures of the form (D,<=,P) where D is either N or Z, <= is a linear ordering on D...
A finite non-empty word z is said to be a border of a finite non-empty word w if w=uz=zv for some no...
AbstractA finite non-empty word z is said to be a border of a finite non-empty word w if w=uz=zv for...
AbstractA finite word is called bordered if it has a proper prefix which is also a suffix of that wo...
AbstractWe formulate and prove a defect theorem for bi-infinite words. Let X be a finite set of word...
AbstractA nonempty word β is said to be a border of a word α if and only if α = λβ = βρ for some non...
International audienceIn this paper, we study languages of finite and infinite birooted words. We sh...
Combinatorics on words is a field of mathematics and theoretical computer science that is concerned...
Abstract. The relationship between the length of a word and the maximum length of its unbordered fac...
Bi-infinite words are sequences of characters that are infinite forwards and backwards; for example ...
We study word structures of the form (D,<,P) where D is either the naturals or the integers with the...
AbstractIn this paper, we provide a new characterization of uniformly recurrent words with finite de...
Let $L_{k,\alpha}^{\mathbb{Z}}$ denote the set of all bi-infinite $\alpha$-power free words over an ...
We study word structures of the form (D, <, P) where D is either N or Z, < is the natural linear ord...
peer reviewedGeneralizing the notion of the boundary sequence introduced by Chen and Wen, the $n$th ...
We study word structures of the form (D,<=,P) where D is either N or Z, <= is a linear ordering on D...