ON A PROPERTY OF THE FACTORIZING CODES

DOI10.1142/S0218196799000217zbMath1040.68051OpenAlexW2036584308MaRDI QIDQ4513297

Clelia De Felice

Publication date: 7 November 2000

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

Full work available at URL: https://doi.org/10.1142/s0218196799000217

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45) Prefix, length-variable, comma-free codes (94A45)

Related Items (6)

On factorizing codes: Structural properties and related decision problems ⋮ FINITE COMPLETIONS VIA FACTORIZING CODES ⋮ An enhanced property of factorizing codes ⋮ Completing codes and the Rédei property of groups ⋮ On some Schützenberger conjectures ⋮ Some combinatorial results on Bernoulli sets and codes

Cites Work

• A counterexample to the triangle conjecture
• The shuffle algebra on the factors of a word is free
• Construction of a family of finite maximal codes
• A conjecture on sets of differences of integer pairs
• On codes having no finite completions
• A conjecture on continued fractions
• A partial result about the factorization conjecture for finite variable- length codes
• A note on codes having no finite completions
• Synchronization and decomposability for a family of codes. II
• Completing codes
• SYNCHRONIZATION AND DECOMPOSABILITY FOR A FAMILY OF CODES

This page was built for publication: ON A PROPERTY OF THE FACTORIZING CODES