Syntactic Complexity of Ultimately Periodic Sets of Integers and Application to a Decision Procedure
Anne Lacroix, Narad Rampersad, Michel Rigo, Élise Vandomme · Fundamenta Informaticae · 2012
We compute the cardinality of the syntactic monoid of the language 0* repb (m$\mathbb{N}$) 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 integer