A graph covering construction of all the finite complete biprefix codes

DOI10.1016/S0012-365X(81)80022-2zbMATH Open0468.68092MaRDI QIDQ1156495FDOQ1156495

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

• Generating all graph coverings by permutation voltage assignments
• Team tournaments and finite elementary codes
• Title not available (Why is that?)
• On a Special Class of Recurrent Events
• Sur un algorithme donnant les codes bipréfixes finis
• La représentation ergodique d'un automate fini

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)