Abstract
We compute the cardinality of the syntactic monoid of the language 0*repb(mℕ) 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.
Cite
CITATION STYLE
Rigo, M., & Vandomme, É. (2011). Syntactic Complexity of Ultimately Periodic Sets of Integers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6638 LNCS, pp. 477–488). Springer Verlag. https://doi.org/10.1007/978-3-642-21254-3_38
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
