No full text
Unpublished conference/Abstract (Scientific congresses and symposiums)
Syntactic complexity of ultimately periodic sets of integers
Rigo, Michel; Vandomme, Elise
2011Numeration 2011
 

Files


Full Text
No document available.
Full Text Parts
Numeration_abstract_Rigo_Vandomme.pdf
Author preprint (112.69 kB)
Download
Numeration_slides_Vandomme.pdf
Publisher postprint (502.26 kB)
Download

All documents in ORBi are protected by a user license.

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 :
Rigo, Michel  ;  Université de Liège - ULiège > Département de mathématique > Mathématiques discrètes
Vandomme, Elise ;  Université de Liège - ULiège > Département de mathématique > Mathématiques discrètes
Language :
English
Title :
Syntactic complexity of ultimately periodic sets of integers
Publication date :
June 2011
Event name :
Numeration 2011
Event organizer :
Michel Rigo
Event place :
Liege, Belgium
Event date :
06/06/2011 -- 10/06/2011
Audience :
International
Available on ORBi :
since 17 May 2014

Statistics


Number of views
40 (4 by ULiège)
Number of downloads
194 (1 by ULiège)

Bibliography


Similar publications



Contact ORBi