Automatic winning shifts

Peltomäki, Jarkko; Salo, Ville

doi:10.1016/j.ic.2022.104883

Cited by 1 publication

(1 citation statement)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the following, we refer to the terminology introduced in [39] (addable systems are called regular in [52]). It is convenient to introduce a new padding symbol # which does not belong to the alphabet A.…”

Section: Numeration Systems and Automatic Wordsmentioning

confidence: 99%

On Extended Boundary Sequences of Morphic and Sturmian Words

Rigo,

Stipulanti,

Whiteland

2024

Electron. J. Combin.

View full text Add to dashboard Cite

Generalizing the notion of the boundary sequence introduced by Chen and Wen, the $n$th term of the $\ell$-boundary sequence of an infinite word is the finite set of pairs $(u,v)$ of prefixes and suffixes of length $\ell$ appearing in factors $uyv$ of length $n+\ell$ ($n\ge \ell\ge 1$). Otherwise stated, for increasing values of $n$, one looks for all pairs of factors of length $\ell$ separated by $n-\ell$ symbols. For the large class of addable abstract numeration systems $S$, we show that if an infinite word is $S$-automatic, then the same holds for its $\ell$-boundary sequence. In particular, they are both morphic (or generated by an HD0L system). To precise the limits of this result, we discuss examples of non-addable numeration systems and $S$-automatic words for which the boundary sequence is nevertheless $S$-automatic and conversely, $S$-automatic words with a boundary sequence that is not $S$-automatic. In the second part of the paper, we study the $\ell$-boundary sequence of a Sturmian word. We show that it is obtained through a sliding block code from the characteristic Sturmian word of the same slope. We also show that it is the image under a morphism of some other characteristic Sturmian word.

show abstract

Section: Numeration Systems and Automatic Wordsmentioning

confidence: 99%