An efficient algorithm to decide periodicity of b-recognisable sets using MSDF convention

Bernard Boigelot, Isabelle Mainz, Victor Marsault +1

Given an integer base $b>1$, a set of integers is represented in base $b$ by a language over $\{0,1,...,b-1\}$. The set is said to be $b$-recognisable if its representation is a re…