No full text
Unpublished conference/Abstract (Scientific congresses and symposiums)
Syntactic complexity of ultimately periodic sets of integers
Vandomme, Elise
2012Journées de l'ANR SubTile: Decidability problems for substitutive sequences, tilings and numerations
 

Files


Full Text
No document available.

Send to



Details



Keywords :
syntactic monoid; complexity; numeration system; decision problem; regular languages
Abstract :
[en] We compute the cardinality of the syntactic monoid of the language 0^∗rep_b(mN) made of base b expansions of the multiples of the integer m. We also give lower bounds for the syntactic complexity of any (ultimately) periodic set of integers written in base b. We apply our results to some well studied problem: decide whether or not a b-recognizable sets of integers is ultimately periodic.
Disciplines :
Mathematics
Author, co-author :
Vandomme, Elise ;  Université de Liège > Département de mathématique > Mathématiques discrètes
Language :
English
Title :
Syntactic complexity of ultimately periodic sets of integers
Publication date :
July 2012
Event name :
Journées de l'ANR SubTile: Decidability problems for substitutive sequences, tilings and numerations
Event place :
Amiens, France
Event date :
2/07/2012 - 4/07/2012
By request :
Yes
Available on ORBi :
since 20 January 2016

Statistics


Number of views
33 (2 by ULiège)
Number of downloads
0 (0 by ULiège)

Bibliography


Similar publications



Contact ORBi