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


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 regular language. It is known that ultimately periodic sets are b-recognisable in every base b, and Cobham’s theorem implies the converse: no other set is b-recognisable in every base… (More)


15 Figures and Tables