[en] A set X ⊆ N is S-recognizable for an abstract numeration system S, if the set rep_S (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−df) n^f ) where c, d ∈ N and f ≥ 1, or Θ(n^r θ^(Θ(n^q))), 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 Θ(n^r ). 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))^k n^ℓ).
Disciplines :
Mathematics
Author, co-author :
Charlier, Emilie ; University of Waterloo > David R. Cheriton School of Computer Science > Mathématiques discrètes
J.-P. Allouche, and J. Shallit Automatic Sequences. Theory, Applications, Generalizations 2003 Cambridge University Press Cambridge
J. Berstel, and Ch. Reutenauer Rational series and their languages EATCS Monographs on Theoretical Computer Science vol. 12 1988 Springer-Verlag Berlin
V. Berthé, and M. Rigo Combinatarics, Automata and Number Theory Encyclopedia of Mathematics and its Applications vol. 135 2010 Cambridge University Press Cambridge
E. Charlier, T. Krki, and M. Rigo Multidimensional generalized automatic sequences and shape-symmetric morphic words Discrete Math. 310 2010 1238 1252
E. Charlier, A. Lacroix, N. Rampersad, Multi-dimensional sets recognizable in all abstract numeration systems (submitted for publication).
E. Charlier, M. Rigo, and W. Steiner Abstract numeration systems on bounded languages and multiplication by a constant Integers 8 A35 2008 19
F. Durand, and M. Rigo Syndeticity and independent substitutions Adv. Appl. Math. 42 1 2009 1 22
S. Eilenberg Automata, Languages, and Machines, vol. A Pure and Applied Mathematics vol. 58 1974 Academic Press New York
P.B.A. Lecomte, and M. Rigo Numeration systems on a regular language Theory Comput. Syst. 34 1 2001 27 44
M. Rigo Generalization of automatic sequences for numeration systems on a regular language Theoret. Comput. Sci. 244 1-2 2000 271 281
M. Rigo Construction of regular languages and recognizability of polynomials Discrete Math. 254 1-3 2002 485 496
M. Rigo, and A. Maes More on generalized automatic sequences J. Autom., Lang. Comb. 7 3 2002 351 376
A. Salomaa, and M. Soittola Automata-theoretic Aspects of Formal Power Series Texts and Monographs in Computer Science 1978 Springer-Verlag New York
N.J.A. Sloane, The On-Line Encyclopedia of Integer Sequences. http://oeis.org/A000108, Catalan numbers.
A.S. Strogalov Regular languages with polynomial growth in the number of words Diskret. Mat. 2 3 1990 146 152
A. Szilard, S. Yu, K. Zhang, and J. Shallit Characterizing regular languages with polynomial densities Mathematical Foundations of Computer Science 1992, Prague, 1992 Lecture Notes in Comput. Sci. vol. 629 1992 Springer Berlin 494 503
Similar publications
Sorry the service is unavailable at the moment. Please try again later.
This website uses cookies to improve user experience. Read more
Save & Close
Accept all
Decline all
Show detailsHide details
Cookie declaration
About cookies
Strictly necessary
Performance
Strictly necessary cookies allow core website functionality such as user login and account management. The website cannot be used properly without strictly necessary cookies.
This cookie is used by Cookie-Script.com service to remember visitor cookie consent preferences. It is necessary for Cookie-Script.com cookie banner to work properly.
Performance cookies are used to see how visitors use the website, eg. analytics cookies. Those cookies cannot be used to directly identify a certain visitor.
Used to store the attribution information, the referrer initially used to visit the website
Cookies are small text files that are placed on your computer by websites that you visit. Websites use cookies to help users navigate efficiently and perform certain functions. Cookies that are required for the website to operate properly are allowed to be set without your permission. All other cookies need to be approved before they can be set in the browser.
You can change your consent to cookie usage at any time on our Privacy Policy page.