Completely reducible sets - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue International Journal of Algebra and Computation Année : 2013

Completely reducible sets

Dominique Perrin

Résumé

We study the family of rational sets of words, called completely reducible and which are such that the syntactic representation of their characteristic series is completely reducible. This family contains, by a result of Reutenauer, the submonoids generated by bifix codes and, by a result of Berstel and Reutenauer, the cyclic sets. We study the closure properties of this family. We prove a result on linear representations of monoids which gives a generalization of the result concerning the complete reducibility of the submonoid generated by a bifix code to sets called birecurrent. We also give a new proof of the result concerning cyclic sets.
Fichier principal
Vignette du fichier
CompleteReducibility.pdf (357.24 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00790760 , version 1 (03-10-2016)

Identifiants

Citer

Dominique Perrin. Completely reducible sets. International Journal of Algebra and Computation, 2013, 23 (4), pp.915-942. ⟨10.1142/S0218196713400158⟩. ⟨hal-00790760⟩
99 Consultations
241 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More