A graph covering construction of all the finite complete biprefix codes (Q1156495)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A graph covering construction of all the finite complete biprefix codes |
scientific article; zbMATH DE number 3735181
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A graph covering construction of all the finite complete biprefix codes |
scientific article; zbMATH DE number 3735181 |
Statements
A graph covering construction of all the finite complete biprefix codes (English)
0 references
1981
0 references
coverings of graphs of homogeneous synchronized automata
0 references
prefix code
0 references
suffix code
0 references
free monoid
0 references
directed graph
0 references
permutation group
0 references
