Ultimate Periodicity of b-Recognisable Sets: A Quasilinear Procedure - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2013

Ultimate Periodicity of b-Recognisable Sets: A Quasilinear Procedure

Résumé

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 description. This yields a O(n log(n)) procedure for deciding whether a gen-eral deterministic automaton accepts an ultimately periodic set of numbers.
Fichier principal
Vignette du fichier
1301.2691v2.pdf (271.2 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01075821 , version 1 (20-10-2014)

Identifiants

Citer

Victor Marsault, Jacques Sakarovitch. Ultimate Periodicity of b-Recognisable Sets: A Quasilinear Procedure. 2014. ⟨hal-01075821⟩
133 Consultations
27 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More