Neutral and tree sets of arbitrary characteristic - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 2017

Neutral and tree sets of arbitrary characteristic

Résumé

We study classes of minimal sets defined by restrictions on the possible extensions of the words. These sets generalize the previously studied classes of neutral and tree sets by relaxing the condition imposed on the empty word and measured by an integer called the characteristic of the set. We present several enumeration results holding in these sets of words. These formulae concern return words and bifix codes. They generalize formulae previously known for Sturmian sets or more generally for tree sets. We also give two geometric examples of this class of sets, namely the natural coding of some interval exchange transformations and the natural coding of some linear involutions.
Fichier principal
Vignette du fichier
NeutralAndTreeSetsOfArbitraryCharacteristic.pdf (251.94 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01367718 , version 1 (16-09-2016)

Identifiants

Citer

Francesco Dolce, Dominique Perrin. Neutral and tree sets of arbitrary characteristic. Theoretical Computer Science, 2017, 658 (part A), pp.159-174. ⟨10.1016/j.tcs.2016.01.008⟩. ⟨hal-01367718⟩
238 Consultations
157 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More