Noncommutative factorization of variable-length codes

DOI10.1016/0022-4049(85)90069-6MaRDI QIDQ1094145zbMATH OpenOpenAlexFDO

Authors 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) Prefix, length-variable, comma-free codes (94A45) Semigroups in automata theory, linguistics, etc. (20M35)

Recommendations

• On the factorization of codes
• Factorizing The Polynomial of a Code
• scientific article; zbMATH DE number 3985118
• scientific article; zbMATH DE number 1047910
• On some Schützenberger conjectures

Cites work

• scientific article; zbMATH DE number 3837389 (Why is no real title available?)
• scientific article; zbMATH DE number 3861454 (Why is no real title available?)
• scientific article; zbMATH DE number 3179521 (Why is no real title available?)
• scientific article; zbMATH DE number 3654376 (Why is no real title available?)
• scientific article; zbMATH DE number 3760085 (Why is no real title available?)
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• scientific article; zbMATH DE number 3574107 (Why is no real title available?)
• scientific article; zbMATH DE number 1988973 (Why is no real title available?)
• scientific article; zbMATH DE number 3367062 (Why is no real title available?)
• A conjecture on sets of differences of integer pairs
• A counterexample to the triangle conjecture
• A family of codes commutatively equivalent to prefix codes
• A note on the triangle conjecture
• Baionnettes et cardinaux
• Codes and Bernoulli partitions
• Codes asynchrones
• Factorizing The Polynomial of a Code
• Free Associative Algebras
• Minimal complete sets of words
• On codes having no finite completions
• On the factorization of codes
• On the triangle conjecture
• Rel�vement d'une mesure ergodique par un codage
• Sur certains sous-monoïdes libres
• The Universal Field of Fractions of a Semifir I. Numerators and Denominators
• Une famille remarquable de codes indecomposables

Cited in

(20)

• Finite maximal codes and factorizations of cyclic groups
• scientific article; zbMATH DE number 176765 (Why is no real title available?)
• On a complete set of operations for factorizing codes
• An enhanced property of factorizing codes
• Factorizing The Polynomial of a Code
• Ensembles libres de chemins dans un graphe
• A non-ambiguous decomposition of regular languages and factorizing codes
• Construction of a family of finite maximal codes
• FINITE COMPLETIONS VIA FACTORIZING CODES
• On factorizing codes: Structural properties and related decision problems
• On the factorization conjecture
• An application of Hajós factorizations to variable-length codes
• Synchronization and decomposability for a family of codes. II
• Non-commutative symbolic coding
• On some Schützenberger conjectures
• Noncommutative symmetric functions associated with a code, Lazard elimination, and Witt vectors
• Finite non-codes revisited from algorithmic points of view
• On the factorization of codes
• A note on the factorization conjecture
• A partial result about the factorization conjecture for finite variable- length codes

This page was built for publication: Noncommutative factorization of variable-length codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1094145)