A graph covering construction of all the finite complete biprefix codes

DOI10.1016/S0012-365X(81)80022-2zbMath0468.68092MaRDI QIDQ1156495

Gerard Lallement, Dominique Perrin

Publication date: 1981

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

directed graphpermutation groupprefix codefree monoidsuffix codecoverings of graphs of homogeneous synchronized automata

Mathematics Subject Classification ID

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

Related Items (2)

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

Cites Work

• Unnamed Item
• La représentation ergodique d'un automate fini
• Generating all graph coverings by permutation voltage assignments
• Team tournaments and finite elementary codes
• Sur un algorithme donnant les codes bipréfixes finis
• On a Special Class of Recurrent Events

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