Decidability of uniform recurrence of morphic sequences - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue International Journal of Foundations of Computer Science Année : 2013

Decidability of uniform recurrence of morphic sequences

Résumé

We prove that the uniform recurrence of morphic sequences is decidable. For this we show that the number of derived sequences of uniformly recurrent morphic sequences is bounded. As a corollary we obtain that uniformly recurrent morphic sequences are primitive substitutive sequences.
Fichier principal
Vignette du fichier
unifrec7.pdf (228.06 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00690883 , version 1 (24-04-2012)
hal-00690883 , version 2 (24-08-2012)

Identifiants

Citer

Fabien Durand. Decidability of uniform recurrence of morphic sequences. International Journal of Foundations of Computer Science, 2013. ⟨hal-00690883v2⟩
96 Consultations
352 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More