Noncommutative factorization of variable-length codes

DOI10.1016/0022-4049(85)90069-6zbMath0629.68079OpenAlexW2090538719MaRDI QIDQ1094145

Christophe Reutenauer

Publication date: 1985

Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-4049(85)90069-6

zbMATH Keywords

invariance propertycharacteristic formal power seriescomplete characterization of maximal and finite codesfactorization of variable-length codes

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35) Prefix, length-variable, comma-free codes (94A45)

Related Items

On factorizing codes: Structural properties and related decision problems ⋮ Synchronization and decomposability for a family of codes. II ⋮ Construction of a family of finite maximal codes ⋮ On the factorization conjecture ⋮ FINITE COMPLETIONS VIA FACTORIZING CODES ⋮ An application of Hajós factorizations to variable-length codes ⋮ An enhanced property of factorizing codes ⋮ A note on the factorization conjecture ⋮ On a complete set of operations for factorizing codes ⋮ Ensembles libres de chemins dans un graphe ⋮ On some Schützenberger conjectures ⋮ A partial result about the factorization conjecture for finite variable- length codes ⋮ A non-ambiguous decomposition of regular languages and factorizing codes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A counterexample to the triangle conjecture
• On the factorization of codes
• Minimal complete sets of words
• A family of codes commutatively equivalent to prefix codes
• A conjecture on sets of differences of integer pairs
• A note on the triangle conjecture
• Baionnettes et cardinaux
• On the triangle conjecture
• On codes having no finite completions
• Factorizing The Polynomial of a Code
• Codes and Bernoulli partitions
• The Universal Field of Fractions of a Semifir I. Numerators and Denominators
• [https://portal.mardi4nfdi.de/wiki/Publication:3883200 Rel�vement d'une mesure ergodique par un codage]
• Codes asynchrones
• Une famille remarquable de codes indecomposables
• Sur certains sous-monoïdes libres
• Free Associative Algebras