A non-ambiguous decomposition of regular languages and factorizing codes

DOI10.1016/S0166-218X(02)00193-2zbMath1012.68100MaRDI QIDQ1861571

Marcella Anselmo

Publication date: 9 March 2003

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

zbMATH Keywords

formal languagescodesnon-ambiguous factorizationsSchützenberger's factorization conjecture

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (3)

On factorizing codes: Structural properties and related decision problems ⋮ FINITE COMPLETIONS VIA FACTORIZING CODES ⋮ On a complete set of operations for factorizing codes

Cites Work

• Noncommutative factorization of variable-length codes
• Construction of a family of finite maximal codes
• On some factorization problems
• A partial result about the factorization conjecture for finite variable- length codes
• Parallel concepts in graph theory
• Motifs et bases de langages
• Codes et motifs
• Codes limites et factorisations finies du monoïde libre
• Factorisation des ensembles préfixiels
• ON LANGUAGES FACTORIZING THE FREE MONOID
• ON THE ROOT OF LANGUAGES
• Sur certains sous-monoïdes libres
• On Concatenative Decompositions of Regular Events
• Centralizers in Free Associative Algebras
• On Decompositions of Regular Events
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A non-ambiguous decomposition of regular languages and factorizing codes