On prefix palindromic length of automatic words

DOI10.1016/J.TCS.2021.08.016OpenAlexW3194783055MaRDI QIDQ2235743

Jarkko Peltomäki, Enzo Laborde, Anna E. Frid

Publication date: 21 October 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

palindromeFibonacci wordRudin-Shapiro wordpalindromic length\(k\)-regular sequencepaperfolding word\(k\)-automatic wordFibonacci-automatic wordperiod-doubling wordprefix palindromic length

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Prefix palindromic length of the Sierpinski word

Cites Work

• Unnamed Item
• On palindromic factorization of words
• 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
• Palindrome complexity.
• Automatic sequences based on Parry or Bertrand numeration systems
• 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
• Decision algorithms for Fibonacci-automatic Words, I: Basic results
• Schrödinger operators with Rudin-Shapiro potentials are not palindromic
• Automatic Sequences
• ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES
• Palindromic length in linear time
• Prefix palindromic length of the Thue-Morse word
• Uniform tag sequences

This page was built for publication: On prefix palindromic length of automatic words