AbstractWe focus on infinite words with languages closed under reversal. If frequencies of all factors are well defined, we show that the number of different frequencies of factors of length n+1 does not exceed 2ΔC(n)+1, where ΔC(n) is the first difference of factor complexity C(n) of the infinite word
Given a finite alphabet $\Sigma$ and a right-infinite word $w$ over the alphabet $\Sigma$, we constr...
We introduce and study a complexity function on words cx(n), called cyclic complexity, which counts ...
In this paper we prove that for any infinite word w whose set of factors is closed under reversal. t...
AbstractWe focus on infinite words with languages closed under reversal. If frequencies of all facto...
AbstractIn this paper, we study the infinite words such that limnp(n)/n=1, by using the Rauzy graphs...
AbstractWe study the relation between the palindromic and factor complexity of infinite words. We sh...
AbstractIn this note, we state a conjecture, and prove it in the periodic case, which is an equality...
AbstractGiven a finite or infinite word v, we consider the set M(v) of minimal forbidden factors of ...
International audienceIn this paper we explore a new hierarchy of classes of languages and infinite ...
International audienceLet A * denote the free monoid generated by a finite nonempty set A. For each ...
ABSTRACT. We investigate the least number of palindromic factors in an infinite word. We first consi...
A finite word w of length n contains at most n + 1 distinct palindromic factors. If the bound n + 1 ...
AbstractIn this paper we prove that for any infinite word w whose set of factors is closed under rev...
We investigate the least number of palindromic factors in an infinite word. We first consider genera...
AbstractWe define several notions of language complexity for finite words, and use them to define an...
Given a finite alphabet $\Sigma$ and a right-infinite word $w$ over the alphabet $\Sigma$, we constr...
We introduce and study a complexity function on words cx(n), called cyclic complexity, which counts ...
In this paper we prove that for any infinite word w whose set of factors is closed under reversal. t...
AbstractWe focus on infinite words with languages closed under reversal. If frequencies of all facto...
AbstractIn this paper, we study the infinite words such that limnp(n)/n=1, by using the Rauzy graphs...
AbstractWe study the relation between the palindromic and factor complexity of infinite words. We sh...
AbstractIn this note, we state a conjecture, and prove it in the periodic case, which is an equality...
AbstractGiven a finite or infinite word v, we consider the set M(v) of minimal forbidden factors of ...
International audienceIn this paper we explore a new hierarchy of classes of languages and infinite ...
International audienceLet A * denote the free monoid generated by a finite nonempty set A. For each ...
ABSTRACT. We investigate the least number of palindromic factors in an infinite word. We first consi...
A finite word w of length n contains at most n + 1 distinct palindromic factors. If the bound n + 1 ...
AbstractIn this paper we prove that for any infinite word w whose set of factors is closed under rev...
We investigate the least number of palindromic factors in an infinite word. We first consider genera...
AbstractWe define several notions of language complexity for finite words, and use them to define an...
Given a finite alphabet $\Sigma$ and a right-infinite word $w$ over the alphabet $\Sigma$, we constr...
We introduce and study a complexity function on words cx(n), called cyclic complexity, which counts ...
In this paper we prove that for any infinite word w whose set of factors is closed under reversal. t...
DOI
Add to ORKG