Palindromic length complexity and a generalization of Thue-Morse sequences
Combinatorics
2019-07-30 v1
Abstract
The notion of palindromic length of a finite word, as well as an infinite word, was first introduced by Frid, Puzynina and Zamboni\cite{FRID2013737}. They conjectured that if the palindromic length of an infinite word is bounded, then this sequence is eventually periodic. In this article, we give a formal expression of the palindromic length of Thue-Morse sequence and find all sequences which have the same palindromic length as Thue-Morse's.
Cite
@article{arxiv.1907.12543,
title = {Palindromic length complexity and a generalization of Thue-Morse sequences},
author = {Shuo Li},
journal= {arXiv preprint arXiv:1907.12543},
year = {2019}
}