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.

中文翻译：

---

很少回文的词，重温

2013 年，Fici 和 Zamboni 证明了许多关于有限和无限单词的定理，这些单词只有少数回文因子。在本文中，我们通过基于有限自动机的不同方法重新推导了他们的一些结果，并获得了一些新结果。