Ultimate periodicity of b-recognisable sets : a quasilinear procedure

Abstract

It is decidable if a set of numbers, whose representation in a base b is a regular language, is ultimately periodic. This was established by Honkala in 1986. We give here a structural description of minimal automata that accept an ultimately periodic set of numbers. We then show that it can be verified in linear time if a given minimal automaton meets this… (More)
DOI: 10.1007/978-3-642-38771-5_32

Topics

9 Figures and Tables

Cite this paper

@inproceedings{Marsault2013UltimatePO, title={Ultimate periodicity of b-recognisable sets : a quasilinear procedure}, author={Victor Marsault and Jacques Sakarovitch}, booktitle={Developments in Language Theory}, year={2013} }