Words With Few Palindromes, Revisited
Formal Languages and Automata Theory
2020-01-07 v3 Discrete Mathematics
Combinatorics
Abstract
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.
Cite
@article{arxiv.1911.12464,
title = {Words With Few Palindromes, Revisited},
author = {Lukas Fleischer and Jeffrey Shallit},
journal= {arXiv preprint arXiv:1911.12464},
year = {2020}
}
Comments
Minor typo corrections