An Efficient Algorithm to Decide Periodicity of b-Recognisable Sets Using MSDF Convention

Abstract

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 eventually 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 b… (More)
DOI: 10.4230/LIPIcs.ICALP.2017.118

Topics

4 Figures and Tables

Cite this paper

@inproceedings{Boigelot2017AnEA, title={An Efficient Algorithm to Decide Periodicity of b-Recognisable Sets Using MSDF Convention}, author={Bernard Boigelot and Isabelle Mainz and Victor Marsault and Michel Rigo}, booktitle={ICALP}, year={2017} }