On uniform recurrence of a direct product - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Discrete Mathematics and Theoretical Computer Science Année : 2010

On uniform recurrence of a direct product

Résumé

The direct product of two words is a naturally defined word on the alphabet of pairs of symbols. An infinite word is uniformly recurrent if each its subword occurs in it with bounded gaps. An infinite word is strongly recurrent if the direct product of it with each uniformly recurrent word is also uniformly recurrent. We prove that fixed points of the expanding binary symmetric morphisms are strongly recurrent. In particular, such is the Thue-Morse word.
Fichier principal
Vignette du fichier
1364-5146-1-PB.pdf (244.84 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00990432 , version 1 (13-05-2014)

Identifiants

Citer

Pavel Vadimovich Salimov. On uniform recurrence of a direct product. Discrete Mathematics and Theoretical Computer Science, 2010, Vol. 12 no. 4 (4), pp.1-8. ⟨10.46298/dmtcs.522⟩. ⟨hal-00990432⟩

Collections

TDS-MACS
131 Consultations
750 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More