Une famille remarquable de codes indecomposables
From MaRDI portal
Publication:4187734
DOI10.1007/3-540-08860-1_9zbMath0402.94036MaRDI QIDQ4187734
Publication date: 1978
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-08860-1_9
20M05: Free semigroups, generators and relations, word problems
94B60: Other types of codes
20M35: Semigroups in automata theory, linguistics, etc.
94A45: Prefix, length-variable, comma-free codes
Related Items
A three-word code which is not prefix-suffix composed, Construction de codes factorisants, Noncommutative factorization of variable-length codes, Synchronization and decomposability for a family of codes. II, On factorizing codes: Structural properties and related decision problems, A note on the factorization conjecture, On a complete set of operations for factorizing codes, Unnamed Item