On some Schützenberger conjectures

DOI10.1006/inco.2000.2932zbMath1007.68097WikidataQ123358435 ScholiaQ123358435MaRDI QIDQ1854441

Clelia De Felice

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.2000.2932

Mathematics Subject Classification ID

68Q45: Formal languages and automata

94A60: Cryptography

68Q70: Algebraic theory of languages and automata

Related Items

FINITE COMPLETIONS VIA 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
• A conjecture on sets of differences of integer pairs
• On codes having no finite completions
• A partial result about the factorization conjecture for finite variable- length codes
• Hajós factorizations and completion of codes.
• ON LANGUAGES FACTORIZING THE FREE MONOID
• SYNCHRONIZATION AND DECOMPOSABILITY FOR A FAMILY OF CODES
• ON A PROPERTY OF THE FACTORIZING CODES
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item