scientific article; zbMATH DE number 3961504

MaRDI QIDQ3728815zbMATH OpenFDO

Authors Clelia De Felice

Publication date 1986

zbMATH Keywords

biprefix codebiprefix maximal finite codescodes of paths in a graphfree monoidvariable-length codes

Mathematics Subject Classification ID

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

Recommendations

• Finite biprefix sets of paths in a graph
• scientific article; zbMATH DE number 3943051
• On the degree of finite maximal biprefix codes
• Completing biprefix codes
• Ensembles libres de chemins dans un graphe

Cited in

(6)

• Finite biprefix sets of paths in a graph
• On the degree of finite maximal biprefix codes
• scientific article; zbMATH DE number 3943051 (Why is no real title available?)
• State splitting for variable-length graphs (Corresp.)
• scientific article; zbMATH DE number 1164012 (Why is no real title available?)
• Ensembles libres de chemins dans un graphe

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 Q3728815)