A graph covering construction of all the finite complete biprefix codes (Q1156495): Difference between revisions
From MaRDI portal
Latest revision as of 13:45, 13 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A graph covering construction of all the finite complete biprefix codes |
scientific article |
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