License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.MFCS.2022.79
URN: urn:nbn:de:0030-drops-168776
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2022/16877/
Go to the corresponding LIPIcs Volume Portal

Rigo, Michel ; Stipulanti, Manon ; Whiteland, Markus A.

On Extended Boundary Sequences of Morphic and Sturmian Words

pdf-format:
LIPIcs-MFCS-2022-79.pdf (0.9 MB)

Abstract

Generalizing the notion of the boundary sequence introduced by Chen and Wen, the nth term of the ?-boundary sequence of an infinite word is the finite set of pairs (u,v) of prefixes and suffixes of length ? appearing in factors uyv of length n+? (n ≥ ? ≥ 1). Otherwise stated, for increasing values of n, one looks for all pairs of factors of length ? separated by n-? symbols.
For the large class of addable numeration systems U, we show that if an infinite word is U-automatic, then the same holds for its ?-boundary sequence. In particular, they are both morphic (or generated by an HD0L system). We also provide examples of numeration systems and U-automatic words with a boundary sequence that is not U-automatic. In the second part of the paper, we study the ?-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.

BibTeX - Entry

@InProceedings{rigo_et_al:LIPIcs.MFCS.2022.79,
  author =	{Rigo, Michel and Stipulanti, Manon and Whiteland, Markus A.},
  title =	{{On Extended Boundary Sequences of Morphic and Sturmian Words}},
  booktitle =	{47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)},
  pages =	{79:1--79:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-256-3},
  ISSN =	{1868-8969},
  year =	{2022},
  volume =	{241},
  editor =	{Szeider, Stefan and Ganian, Robert and Silva, Alexandra},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2022/16877},
  URN =		{urn:nbn:de:0030-drops-168776},
  doi =		{10.4230/LIPIcs.MFCS.2022.79},
  annote =	{Keywords: Boundary sequences, Sturmian words, Numeration systems, Automata, Graph of addition}
}

Keywords: Boundary sequences, Sturmian words, Numeration systems, Automata, Graph of addition
Collection: 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)
Issue Date: 2022
Date of publication: 22.08.2022

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI