Prefix palindromic length of the Sierpinski word

DOI10.1007/978-3-031-05578-2_6OpenAlexW4280533687MaRDI QIDQ2163982

Dora Bulgakova, Jérémy Scanvic, Anna E. Frid

Publication date: 11 August 2022

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• On palindromic factorization of words
• Palindromic length in free monoids and free groups
• Sturmian numeration systems and decompositions to palindromes
• On prefix palindromic length of automatic words
• Automatic Sequences
• Greedy Palindromic Lengths
• Upper bound for palindromic and factor complexity of rich words
• Prefix palindromic length of the Thue-Morse word
• Uniform tag sequences

This page was built for publication: Prefix palindromic length of the Sierpinski word