A graph covering construction of all the finite complete biprefix codes
From MaRDI portal
Publication:1156495
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)
directed graph; permutation group; prefix code; free monoid; suffix code; coverings of graphs of homogeneous synchronized automata
Related Items
Cites Work