Article thumbnail

The growth function of S-recognizable sets

By Émilie Charlier and Narad Rampersad

Abstract

AbstractA set X⊆N is S-recognizable for an abstract numeration system S, if the set repS(X) of its representations is accepted by a finite automaton. We show that the growth function of an S-recognizable set is always either Θ((log(n))c−dfnf) where c,d∈N and f≥1, or Θ(nrθΘ(nq)), where r,q∈Q with q≤1. If the number of words of length n in the numeration language is bounded by a polynomial, then the growth function of an S-recognizable set is Θ(nr), where r∈Q with r≥1. Furthermore, for every r∈Q with r≥1, we can provide an abstract numeration system S built on a polynomial language and an S-recognizable set such that the growth function of X is Θ(nr). For all positive integers k and ℓ, we can also provide an abstract numeration system S built on an exponential language and an S-recognizable set such that the growth function of X is Θ((log(n))knℓ)

Publisher: Elsevier B.V.
Year: 2011
DOI identifier: 10.1016/j.tcs.2011.05.057
OAI identifier:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • https://s3-eu-west-1.amazonaws... (external link)
  • https://s3.amazonaws.com/prod-... (external link)
  • Suggested articles


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