AbstractWe define several notions of language complexity for finite words, and use them to define and compute some new complexity functions for infinite sequences. In particular, they give a new characterization of Sturmian sequences and discriminate between Sturmian sequences with bounded or unbounded partial quotients
AbstractWe study the relation between the palindromic and factor complexity of infinite words. We sh...
International audienceWe introduce and study a complexity function on words $c_x(n),$ called \emph{c...
In this paper we investigate local-to-global phenomena for a new family of complexity functions of i...
AbstractWe define several notions of language complexity for finite words, and use them to define an...
International audienceFor an extensive range of infinite words, and the associated symbolic dynamica...
International audienceIn this paper we give a broad unified framework via group actions for construc...
AbstractIn this article, we construct a family of infinite words, generated by countable automata an...
AbstractThis is a survey of recent results on the notion of symbolic complexity, which counts the nu...
31 pagesThe complexity function of an infinite word $w$ on a finite alphabet $A$ is the sequence cou...
The subword complexity function pw of a finite word w over a finite alphabet A with cardA = q ≥ 1 is...
In this paper we introduce and study a family of complexity functions of infinite words indexed by k...
We tackle the problem of studying which kind of functions can occur as complexity functions of forma...
AbstractArithmetical complexity of infinite sequences is the number of all words of a given length w...
Bell and Shallit recently introduced the Lie complexity of an infinite word s as the function counti...
We study the complexity of the infinite word uβ associated with the Rényi expansion of 1 in an irrat...
AbstractWe study the relation between the palindromic and factor complexity of infinite words. We sh...
International audienceWe introduce and study a complexity function on words $c_x(n),$ called \emph{c...
In this paper we investigate local-to-global phenomena for a new family of complexity functions of i...
AbstractWe define several notions of language complexity for finite words, and use them to define an...
International audienceFor an extensive range of infinite words, and the associated symbolic dynamica...
International audienceIn this paper we give a broad unified framework via group actions for construc...
AbstractIn this article, we construct a family of infinite words, generated by countable automata an...
AbstractThis is a survey of recent results on the notion of symbolic complexity, which counts the nu...
31 pagesThe complexity function of an infinite word $w$ on a finite alphabet $A$ is the sequence cou...
The subword complexity function pw of a finite word w over a finite alphabet A with cardA = q ≥ 1 is...
In this paper we introduce and study a family of complexity functions of infinite words indexed by k...
We tackle the problem of studying which kind of functions can occur as complexity functions of forma...
AbstractArithmetical complexity of infinite sequences is the number of all words of a given length w...
Bell and Shallit recently introduced the Lie complexity of an infinite word s as the function counti...
We study the complexity of the infinite word uβ associated with the Rényi expansion of 1 in an irrat...
AbstractWe study the relation between the palindromic and factor complexity of infinite words. We sh...
International audienceWe introduce and study a complexity function on words $c_x(n),$ called \emph{c...
In this paper we investigate local-to-global phenomena for a new family of complexity functions of i...
DOI
Add to ORKG