Hall sets, Lazard sets and comma-free codes - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discrete Mathematics Année : 2018

Hall sets, Lazard sets and comma-free codes

Résumé

We investigate the relationship between two constructions of maximal comma-free codes described, respectively, by Eastman and by Scholtz and the notions of Hall sets and Lazard sets introduced in connection with factorizations of free monoids and bases of free Lie algebras.

Dates et versions

hal-01804538 , version 1 (31-05-2018)

Identifiants

Citer

Dominique Perrin, Christophe Reutenauer. Hall sets, Lazard sets and comma-free codes. Discrete Mathematics, 2018, 341 (1), pp.232-243. ⟨10.1016/j.disc.2017.08.034⟩. ⟨hal-01804538⟩
46 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More