On extended boundary sequences of morphic and Sturmian words
Michel Rigo, Manon Stipulanti, Markus A. Whiteland

TL;DR
This paper explores the properties of extended boundary sequences of morphic and Sturmian words, demonstrating their automaticity in certain numeration systems and analyzing their structure through morphisms and sliding block codes.
Contribution
It generalizes the boundary sequence concept, establishes automaticity results for $S$-automatic words in addable numeration systems, and characterizes boundary sequences of Sturmian words via morphisms and sliding block codes.
Findings
Boundary sequences are morphic for $S$-automatic words in addable systems.
Examples show the limits of automaticity transfer between words and boundary sequences.
Boundary sequences of Sturmian words relate to characteristic Sturmian words through morphisms.
Abstract
Generalizing the notion of the boundary sequence introduced by Chen and Wen, the th term of the -boundary sequence of an infinite word is the finite set of pairs of prefixes and suffixes of length appearing in factors of length (). Otherwise stated, for increasing values of , one looks for all pairs of factors of length separated by symbols. For the large class of addable abstract numeration systems , we show that if an infinite word is -automatic, then the same holds for its -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 -automatic words for which the boundary sequence is nevertheless -automatic and conversely, -automatic words with a boundary sequence…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
