Publication date
October 2001
DOI Publisher
Elsevier Science B.V. ISSN
0166-218XAbstract
AbstractA description is obtained for the factor graphs, or Rauzy graphs, of uniform marked circular DOL words
AbstractA description is obtained for the factor graphs, or Rauzy graphs, of uniform marked circular DOL words
The following result is established: Let L be a DOL language and x1, x2,…, a sequence of all words i...
AbstractIn this paper we consider a combinatorial method for the analysis of finite words recently i...
International audienceWe introduce and study a complexity function on words c x (n), called cyclic c...
AbstractA description is obtained for the factor graphs, or Rauzy graphs, of uniform marked circular...
AbstractWe focus on infinite words with languages closed under reversal. If frequencies of all facto...
The $\ell$-Rauzy graph of order $k$ for any infinite word is a directed graph in which an arc $(v_1,...
AbstractIn this paper, we study the infinite words such that limnp(n)/n=1, by using the Rauzy graphs...
AbstractWe study bispecial factors in fixed points of morphisms. In particular, we propose a simple ...
Minimal forbidden factors are a useful tool for investigating properties of words and languages. Two...
In this paper we study graphs defined by pattern-avoiding words. Word-representable graphs have been...
In this paper we prove the following result. Let s be an infinite word on a finite alphabet, and N ≥...
AbstractThe subword complexity of a language K is the function which to every positive integer n ass...
We present in this PhD. in Mathematics the work effectuated during three years at the Lyon 1 Univers...
AbstractArithmetical complexity of infinite sequences is the number of all words of a given length w...
International audienceLet A * denote the free monoid generated by a finite nonempty set A. For each ...
The following result is established: Let L be a DOL language and x1, x2,…, a sequence of all words i...
AbstractIn this paper we consider a combinatorial method for the analysis of finite words recently i...
International audienceWe introduce and study a complexity function on words c x (n), called cyclic c...
AbstractA description is obtained for the factor graphs, or Rauzy graphs, of uniform marked circular...
AbstractWe focus on infinite words with languages closed under reversal. If frequencies of all facto...
The $\ell$-Rauzy graph of order $k$ for any infinite word is a directed graph in which an arc $(v_1,...
AbstractIn this paper, we study the infinite words such that limnp(n)/n=1, by using the Rauzy graphs...
AbstractWe study bispecial factors in fixed points of morphisms. In particular, we propose a simple ...
Minimal forbidden factors are a useful tool for investigating properties of words and languages. Two...
In this paper we study graphs defined by pattern-avoiding words. Word-representable graphs have been...
In this paper we prove the following result. Let s be an infinite word on a finite alphabet, and N ≥...
AbstractThe subword complexity of a language K is the function which to every positive integer n ass...
We present in this PhD. in Mathematics the work effectuated during three years at the Lyon 1 Univers...
AbstractArithmetical complexity of infinite sequences is the number of all words of a given length w...
International audienceLet A * denote the free monoid generated by a finite nonempty set A. For each ...
The following result is established: Let L be a DOL language and x1, x2,…, a sequence of all words i...
AbstractIn this paper we consider a combinatorial method for the analysis of finite words recently i...
International audienceWe introduce and study a complexity function on words c x (n), called cyclic c...
Add to ORKG