Skip to main content
Article thumbnail
Location of Repository

On the number of palindromically rich words

By A. Glen

Abstract

Rich words (also known as full words ) are a special family of finite and infinite words characterised by containing the maximal number of distinct palindromes. We prove that the number of rich words of length n over a finite alphabet A (consisting of 3 or more letters) grows at least polynomially with the size of A. We also show asymptotic exponential growth for the number of rich words of length 2n over a 2-letter alphabet. Moreover, we discuss possible factor complexity functions of rich words and consider the difficult (open) problem of enumerating the finite rich words over a fixed finite alphabet

Year: 2015
OAI identifier: oai:researchrepository.murdoch.edu.au:39771
Provided by: Research Repository
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://researchrepository.murd... (external link)
  • http://researchrepository.murd... (external link)
  • http://researchrepository.murd... (external link)
  • http://researchrepository.murd... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.