Prefix palindromic length of the Thue-Morse word

zbMath1437.68146arXiv1906.09392MaRDI QIDQ5212137

Anna E. Frid

Publication date: 27 January 2020

Full work available at URL: https://arxiv.org/abs/1906.09392

zbMATH Keywords

regular sequenceThue-Morse wordpalindromic lengthautomatic word

Mathematics Subject Classification ID

Combinatorics on words (68R15) Automata sequences (11B85)

Related Items (3)

Prefix palindromic length of the Sierpinski word ⋮ On prefix palindromic length of automatic words ⋮ Monochromatic arithmetic progressions in binary Thue-Morse-like words

Uses Software

• OEIS
• EERTREE

Cites Work

• Unnamed Item
• On palindromic factorization of words
• A subquadratic algorithm for minimum palindromic factorization
• The ring of \(k\)-regular sequences
• EERTREE: an efficient data structure for processing palindromes in strings
• Palindromic length in free monoids and free groups
• Sturmian numeration systems and decompositions to palindromes
• First lower bounds for palindromic length
• Palindromic length of words and morphisms in class \(\mathcal{P}\)
• Decision Algorithms for Fibonacci-Automatic Words, III: Enumeration and Abelian Properties
• Automatic Sequences
• ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES
• Palindromic length in linear time
• Uniform tag sequences

This page was built for publication: Prefix palindromic length of the Thue-Morse word