Words With Few Palindromes, Revisited

11/27/2019

∙

by   Lukas Fleischer, et al.

∙

0

∙

share

In 2013, Fici and Zamboni proved a number of theorems about finite and infinite words having only a small number of factors that are palindromes. In this paper we rederive some of their results, and obtain some new ones, by a different method based on finite automata.