A graph covering construction of all the finite complete biprefix codes (Q1156495): Difference between revisions

@@ Property / author @@
-Dominique Perrin
@@ Property / author: Dominique Perrin / rank @@
-Normal rank
@@ Property / author @@
+Dominique Perrin
@@ Property / author: Dominique Perrin / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Sur un algorithme donnant les codes bipréfixes finis
+Normal rank
@@ Property / cites work @@
+Generating all graph coverings by permutation voltage assignments
+Normal rank
@@ Property / cites work @@
+Team tournaments and finite elementary codes
@@ Property / cites work: Team tournaments and finite elementary codes / rank @@
+Normal rank
@@ Property / cites work @@
+Q4100680
@@ Property / cites work: Q4100680 / rank @@
+Normal rank
@@ Property / cites work @@
+La représentation ergodique d'un automate fini
@@ Property / cites work: La représentation ergodique d'un automate fini / rank @@
+Normal rank
@@ Property / cites work @@
+On a Special Class of Recurrent Events
@@ Property / cites work: On a Special Class of Recurrent Events / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1156495