Hall sets, Lazard sets and comma-free codes
From MaRDI portal
Publication:2411623
DOI10.1016/j.disc.2017.08.034zbMath1409.94850arXiv1609.05438OpenAlexW2964250074MaRDI QIDQ2411623
Christophe Reutenauer, Dominique Perrin
Publication date: 24 October 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1609.05438
Identities, free Lie (super)algebras (17B01) Communication theory (94A05) Prefix, length-variable, comma-free codes (94A45)
Related Items (5)
New results on Nyldon words and Nyldon-like sets ⋮ Reducing the local alphabet size in tiling systems by means of 2D comma-free codes ⋮ Graded alphabets, circular codes, free Lie algebras and comma-free codes ⋮ Homomorphic characterization of tree languages based on comma-free encoding ⋮ Nyldon words
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Series formelles et algèbres syntactiques
- Free Lie algebras and free monoids. Bases of free Lie algebras and factorizations of free monoids
- Comma-Free Codes
- Regent Results in Comma-Free Codes
- On the construction of comma-free codes
- Maximal and variable word-length comma-free codes
This page was built for publication: Hall sets, Lazard sets and comma-free codes