Back to Search
Start Over
Words With Few Palindromes, Revisited
- Publication Year :
- 2019
- Publisher :
- arXiv, 2019.
-
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.<br />Comment: Minor typo corrections
- Subjects :
- FOS: Computer and information sciences
Discrete Mathematics (cs.DM)
Formal Languages and Automata Theory (cs.FL)
FOS: Mathematics
Mathematics - Combinatorics
Computer Science - Formal Languages and Automata Theory
Combinatorics (math.CO)
Computer Science::Formal Languages and Automata Theory
Computer Science - Discrete Mathematics
Subjects
Details
- Database :
- OpenAIRE
- Accession number :
- edsair.doi.dedup.....4ffe21884be34b690b91bf13f06923cc
- Full Text :
- https://doi.org/10.48550/arxiv.1911.12464