Add to ORKGsummary:We show a connection between a recent conjecture of Shallit and an older conjecture of Rauzy for infinite words on a finite alphabet. More precisely we show that a Rauzy-like conjecture is equivalent to Shallit's. In passing we correct a misprint in Rauzy's conjecture
AbstractIn this paper we prove that, except for at most one, all the ranks of a right infinite word ...
AbstractIn this paper we use the relation of the index of an infinite aperiodic word and its recurre...
AbstractIn Section 1 we study the relations among some combinatorial properties of infinite words, e...
summary:We show a connection between a recent conjecture of Shallit and an older conjecture of Rauzy...
The $\ell$-Rauzy graph of order $k$ for any infinite word is a directed graph in which an arc $(v_1,...
AbstractWe focus on infinite words with languages closed under reversal. If frequencies of all facto...
AbstractThe (maximal) exponent of a non-empty finite word is the ratio of its length to its period. ...
In this paper we prove the following result. Let s be an infinite word on a finite alphabet, and N ≥...
AbstractBrlek and Reutenauer conjectured that any infinite word u with language closed under reversa...
Many combinatorial and arithmetical properties have been studied for infinite words ub associated wi...
Partial words are sequences over a finite alphabet that may contain wildcard symbols, called holes, ...
AbstractIn this paper we study infinite episturmian words which are a natural generalization of Stur...
We study word structures of the form (D,<,P) where D is either the naturals or the integers with the...
AbstractWe define several notions of language complexity for finite words, and use them to define an...
International audienceThe exponent of a word is the ratio of its length over its smallest period. Th...
AbstractIn this paper we prove that, except for at most one, all the ranks of a right infinite word ...
AbstractIn this paper we use the relation of the index of an infinite aperiodic word and its recurre...
AbstractIn Section 1 we study the relations among some combinatorial properties of infinite words, e...
summary:We show a connection between a recent conjecture of Shallit and an older conjecture of Rauzy...
The $\ell$-Rauzy graph of order $k$ for any infinite word is a directed graph in which an arc $(v_1,...
AbstractWe focus on infinite words with languages closed under reversal. If frequencies of all facto...
AbstractThe (maximal) exponent of a non-empty finite word is the ratio of its length to its period. ...
In this paper we prove the following result. Let s be an infinite word on a finite alphabet, and N ≥...
AbstractBrlek and Reutenauer conjectured that any infinite word u with language closed under reversa...
Many combinatorial and arithmetical properties have been studied for infinite words ub associated wi...
Partial words are sequences over a finite alphabet that may contain wildcard symbols, called holes, ...
AbstractIn this paper we study infinite episturmian words which are a natural generalization of Stur...
We study word structures of the form (D,<,P) where D is either the naturals or the integers with the...
AbstractWe define several notions of language complexity for finite words, and use them to define an...
International audienceThe exponent of a word is the ratio of its length over its smallest period. Th...
AbstractIn this paper we prove that, except for at most one, all the ranks of a right infinite word ...
AbstractIn this paper we use the relation of the index of an infinite aperiodic word and its recurre...
AbstractIn Section 1 we study the relations among some combinatorial properties of infinite words, e...