A partial result about the factorization conjecture for finite variable- length codes

DOI10.1016/0012-365X(93)90291-ZzbMath0798.68084WikidataQ122943772 ScholiaQ122943772MaRDI QIDQ1313854

Clelia De Felice

Publication date: 1 March 1994

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

finite maximal codes; factorization conjecture; finite variable-length codes

Mathematics Subject Classification ID

68Q45: Formal languages and automata

94A45: Prefix, length-variable, comma-free codes

Related Items

ON A PROPERTY OF THE FACTORIZING CODES, FINITE COMPLETIONS VIA FACTORIZING CODES, An application of Hajós factorizations to variable-length codes, Finite maximal codes and triangle conjecture, On some Schützenberger conjectures, A non-ambiguous decomposition of regular languages and factorizing codes, On factorizing codes: Structural properties and related decision problems, An enhanced property of factorizing codes, A note on the factorization conjecture, On a complete set of operations for factorizing codes

Cites Work

• On the factorization of codes
• Noncommutative factorization of variable-length codes
• Construction of a family of finite maximal codes
• On codes having no finite completions
• Codes asynchrones
• On the factorization conjecture
• Sur certains sous-monoïdes libres
• Sur un algorithme donnant les codes bipréfixes finis
• Sur le problème de factorisation des groupes cycliques
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item