FINITE COMPLETIONS VIA FACTORIZING CODES

DOI10.1142/S0218196707003871zbMath1201.94069MaRDI QIDQ5386969

Clelia De Felice

Publication date: 14 May 2008

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

zbMATH Keywords

variable-length codes; Formal languages; factorizing codes; factorizations of cyclic groups

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68Q70: Algebraic theory of languages and automata

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

Related Items

The Exhaustion Numbers of the Generalized Quaternion Groups, A note on the factorization conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• An application of Hajós factorizations to variable-length codes
• Noncommutative factorization of variable-length codes
• Construction of a family of finite maximal codes
• On codes having no finite completions
• A partial result about the factorization conjecture for finite variable- length codes
• A note on codes having no finite completions
• Hajós factorizations and completion of codes.
• On some Schützenberger conjectures
• A non-ambiguous decomposition of regular languages and factorizing codes
• Synchronization and decomposability for a family of codes. II
• On factorizing codes: Structural properties and related decision problems
• An enhanced property of factorizing codes
• On the factorisation of finite abelian groups
• On a complete set of operations for factorizing codes
• Completing codes
• ON A PROPERTY OF THE FACTORIZING CODES