Scientific conference in universities or research centers (Scientific conferences in universities or research centers)
S-automatic sets
Charlier, Emilie
2010
 

Files


Full Text
Seminaire_Lacim_3_decembre_2010.pdf
Author preprint (447.28 kB)
Download

All documents in ORBi are protected by a user license.

Send to



Details



Keywords :
Abstract numeration systems; Automata; Integers
Abstract :
[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.
Disciplines :
Mathematics
Author, co-author :
Charlier, Emilie  ;  Université de Liège - ULiège > Département de mathématique > Mathématiques discrètes
Language :
English
Title :
S-automatic sets
Publication date :
December 2010
Event name :
Séminaire de combinatoire et d'informatique mathématique du LaCIM (UQÀM)
Event place :
Montréal, Canada
Event date :
3 décembre 2010
Available on ORBi :
since 19 June 2012

Statistics


Number of views
45 (1 by ULiège)
Number of downloads
25 (1 by ULiège)

Bibliography


Similar publications



Contact ORBi