Skip to Main content Skip to Navigation
Journal articles

Hall sets, Lazard sets and comma-free codes

Abstract : 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.
Complete list of metadata
Contributor : Admin Upem Connect in order to contact the contributor
Submitted on : Thursday, May 31, 2018 - 4:58:52 PM
Last modification on : Saturday, January 15, 2022 - 3:59:22 AM

Links full text



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



Record views