Reference : S-automatic sets
Scientific conferences in universities or research centers : Scientific conference in universities or research centers
Physical, chemical, mathematical & earth Sciences : Mathematics
S-automatic sets
Charlier, Emilie mailto [Université de Liège - ULiège > Département de mathématique > Mathématiques discrètes >]
Séminaire de combinatoire et d'informatique mathématique du LaCIM (UQÀM)
3 décembre 2010
[en] Abstract numeration systems ; Automata ; Integers
[en] In this talk, I will discuss some new properties of S-automatic sets. First I will show that a multidimensional set is S-automatic for all abstract numeration systems S if and only if it is 1-automatic. This result is surprising in the following sense: the class of multidimensional 1-automatic sets is a strict subclass of that of semi-linear sets. Hence, this result is not a generalization of the well-known result in integer base numeration systems: a multidimensional set is b-automatic for all integer bases b ≥ 1 if and only if it is semi-linear. Second I will describe the possible behaviors of the nth -term of an S-automatic set, depending on the growth function (i.e., the number of words of length n) of the numeration language.

File(s) associated to this reference

Fulltext file(s):

Open access
Seminaire_Lacim_3_decembre_2010.pdfAuthor preprint436.8 kBView/Open

Bookmark and Share SFX Query

All documents in ORBi are protected by a user license.