On the group of a rational maximal bifix code - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Forum Mathematicum Année : 2020

On the group of a rational maximal bifix code

Résumé

Abstract We give necessary and sufficient conditions for the group of a rational maximal bifix code Z to be isomorphic with the F -group of Z ∩ F {Z ∪ F} , when F is recurrent and Z ∩ F {Z ∪ F} is rational. The case where F is uniformly recurrent, which is known to imply the finiteness of Z ∩ F {Z ∪ F} , receives special attention. The proofs are done by exploring the connections with the structure of the free profinite monoid over the alphabet of F .

Dates et versions

hal-03226871 , version 1 (15-05-2021)

Identifiants

Citer

Jorge Almeida, Alfredo Costa, Revekka Kyriakoglou, Dominique Perrin. On the group of a rational maximal bifix code. Forum Mathematicum, 2020, 32 (3), pp.553-576. ⟨10.1515/forum-2018-0270⟩. ⟨hal-03226871⟩
56 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More