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

@article{Marsault2019AnEA, title={An efficient algorithm to decide periodicity of bbb-recognisable sets using LSDF convention}, author={Victor Marsault}, journal={Log. Methods Comput. Sci.}, year={2019}, volume={15} }

Let b be an integer strictly greater than 1. Each set of nonnegative integers is represented in base b by a language over {0, 1, . . . , b−1}. The set is said to be b-recognisable if it is represented by a regular language. It is known that ultimately periodic sets are b-recognisable, for every base b, and Cobham’s theorem implies the converse: no other set is b-recognisable in every base b. We consider the following decision problem: let S be a set of nonnegative integers that is b… CONTINUE READING

One Citation

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

- Mathematics, Computer Science
- 2017

6