A graph covering construction of all the finite complete biprefix codes

DOI10.1016/S0012-365X(81)80022-2MaRDI QIDQ1156495zbMATH OpenFDO

Authors Gerard Lallement, Dominique Perrin

Publication date 1981

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

directed graphpermutation groupfree monoidprefix codesuffix codecoverings of graphs of homogeneous synchronized automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Prefix, length-variable, comma-free codes (94A45)

Cites work

• scientific article; zbMATH DE number 3522202 (Why is no real title available?)
• Generating all graph coverings by permutation voltage assignments
• La représentation ergodique d'un automate fini
• On a Special Class of Recurrent Events
• Sur un algorithme donnant les codes bipréfixes finis
• Team tournaments and finite elementary codes

Cited in

(2)

• Groups of finite elementary codes
• Gérard Lallement (1935-2006)

This page was built for publication: A graph covering construction of all the finite complete biprefix codes

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