scientific article

zbMath0567.68046MaRDI QIDQ3683550

Max Vincent

Publication date: 1985

Full work available at URL: https://eudml.org/doc/92228

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

prefix codessuffix codesfree submonoids

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35) Prefix, length-variable, comma-free codes (94A45)

Related Items (7)

Construction de codes factorisants ⋮ Synchronization and decomposability for a family of codes. II ⋮ Birecurrent sets ⋮ On the factorization conjecture ⋮ On a zeta function associated with automata and codes ⋮ On a complete set of operations for factorizing codes ⋮ A partial result about the factorization conjecture for finite variable- length codes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• Sur le produit de concatenation non ambigu
• Codes asynchrones
• Une famille remarquable de codes indecomposables
• Sur certains sous-monoïdes libres
• Sur un algorithme donnant les codes bipréfixes finis
• On a Special Class of Recurrent Events

This page was built for publication: