Prefix palindromic length of the Sierpinski word
Dora V. Bulgakova, Anna E. Frid, J\'er\'emy Scanvic

TL;DR
This paper investigates the prefix palindromic length of the Sierpinski word, providing a complete description and contributing to the understanding of its regularity properties in the context of automatic and non-automatic words.
Contribution
It introduces the prefix palindromic length of the Sierpinski word and characterizes its behavior, expanding the class of automatic words with known regularity properties.
Findings
The prefix palindromic length of the Sierpinski word is fully described.
The Sierpinski word's prefix palindromic length exhibits specific regularity properties.
This work adds to the understanding of palindromic structures in automatic sequences.
Abstract
The prefix palindromic length of an infinite word is the minimal number of concatenated palindromes needed to express the prefix of length of . This function is surprisingly difficult to study; in particular, the conjecture that can be bounded only if is ultimately periodic is open since 2013. A more recent conjecture concerns the prefix palindromic length of the period doubling word: it seems that it is not -regular, and if it is true, this would give a rare if not unique example of a non-regular function of a -automatic word. For some other -automatic words, however, the prefix palindromic length is known to be -regular. Here we add to the list of those words the Sierpinski word and give a complete description of .
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.
Taxonomy
Topicssemigroups and automata theory · Algorithms and Data Compression · Mathematical Dynamics and Fractals
