scientific article; zbMATH DE number 3905865

MaRDI QIDQ3683550zbMATH OpenFDO

Authors Max Vincent

Publication date 1985

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

zbMATH Keywords

prefix codesfree submonoidssuffix codes

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3654376 (Why is no real title available?)
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• scientific article; zbMATH DE number 3529706 (Why is no real title available?)
• scientific article; zbMATH DE number 3332047 (Why is no real title available?)
• A Mathematical Theory of Communication
• Codes asynchrones
• On a Special Class of Recurrent Events
• Sur certains sous-monoïdes libres
• Sur le produit de concatenation non ambigu
• Sur un algorithme donnant les codes bipréfixes finis
• Une famille remarquable de codes indecomposables

Cited in

(7)

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

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3683550)