Related papers: Quasiperiodic Sturmian words and morphisms
Almost periodicity has been considered in Formal Language Theory in connection with some topics in Symbolic Dynamics. In (P\u{a}un and Marcus, Bulletin of EATCS 53 (1994)) some problems concerning this property are raised. For instance it…
We provide an exact estimate on the maximal subword complexity for quasiperiodic infinite words. To this end we give a representation of the set of finite and of infinite words having a certain quasiperiod q via a finite language derived…
In this paper we study the class of so-called privileged words which have been previously considered only a little. We develop the basic properties of privileged words, which turn out to share similar properties with palindromes. Privileged…
An infinite word, which is aperiodic and codes the orbit of a transformation of the exchange of three intervals is called 3iet word. Such a word is thus a natural generalization of a sturmian word to a word over 3-letter alphabet. A…
In this book chapter, written in French, we consider the classical family of Sturmian words, defined as the aperiodic infinite words containing only $n+1$ factors of a length $n$, which is the minimal possible value. We will discuss several…
In some particular cases we give criteria for morphic sequences to be almost periodic (=uniformly recurrent). Namely, we deal with fixed points of non-erasing morphisms and with automatic sequences. In both cases a polynomial-time algorithm…
We prove that if a uniformly recurrent infinite word contains as a factor any finite permutation of words from an infinite family, then either this word is periodic, or its complexity (that is, the number of factors) grows faster than…
In this paper we introduce and study a new property of infinite words: An infinite word $x\in A^\mathbb{N}$, with values in a finite set $A$, is said to be $k$-self-shuffling $(k\geq 2)$ if $x$ admits factorizations: $x=\prod_{i=0}^\infty…
Given an $\omega$-automaton and a set of substitutions, we look at which accepted words can also be defined through these substitutions, and in particular if there is at least one. We introduce a method using desubstitution of…
In this paper we explore various interconnections between rich words, Sturmian words, and trapezoidal words. Rich words, first introduced in arXiv:0801.1656 by the second and third authors together with J. Justin and S. Widmer, constitute a…
A finite Sturmian word w over the alphabet {a,b} is left special (resp. right special) if aw and bw (resp. wa and wb) are both Sturmian words. A bispecial Sturmian word is a Sturmian word that is both left and right special. We show as a…
In our earlier paper [A square root map on Sturmian words, Electron. J. Combin. 24.1 (2017)], we introduced a symbolic square root map. Every optimal squareful infinite word $s$ contains exactly six minimal squares and can be written as a…
In this paper, we analyze the periodic factors of Sturmian words for the findings to lead to a linear-time algorithm for the computation of runs in this class of words which, to our best knowledge, is an open problem in literature.
We generalize the familiar notion of periodicity in sequences to a new kind of pseudoperiodicity, and we prove some basic results about it. We revisit the results of a 2012 paper of Shevelev and reprove his results in a simpler and more…
An S-adic expansion of an infinite word is a way of writing it as the limit of an infinite product of substitutions (i.e., morphisms of a free monoid). Such a description is related to continued fraction expansions of numbers and vectors. A…
It is argued that the definition of quasicrystals should not include the requirement that they possess an axis of symmetry that is forbidden in periodic crystals. The term "quasicrystal" should simply be regarded as an abbreviation for…
In this paper, we survey the rich theory of infinite episturmian words which generalize to any finite alphabet, in a rather resembling way, the well-known family of Sturmian words on two letters. After recalling definitions and basic…
We introduce and study a complexity function on words $c_x(n),$ called \emph{cyclic complexity}, which counts the number of conjugacy classes of factors of length $n$ of an infinite word $x.$ We extend the well-known Morse-Hedlund theorem…
The palindromic length of the finite word $v$ is equal to the minimal number of palindromes whose concatenation is equal to $v$. It was conjectured in 2013 that for every infinite aperiodic word $x$, the palindromic length of its factors is…
Trapezoidal words are finite words having at most n+1 distinct factors of length n, for every n>=0. They encompass finite Sturmian words. We distinguish trapezoidal words into two disjoint subsets: open and closed trapezoidal words. A…