Prefix codes and isomorphic automata

References

• Ginzburg , A. 1968 . Algebraic Theory of Automata , Academic Press .
   Google Scholar
• Lassez , J.L. 1972 . On the structure of systematic prefix codes . International Journal of Computer Mathematics ,
   Web of Science ®Google Scholar
• Neumann , P.J. 1962 . Efficient error limiting variable length codes . IR.E. Trans, Inf Theory , IT8 July
   Google Scholar
• Nivat , M. 1966 . “ Elements da la Theorie Generale des Codes ” . In Automata Theory , New York : Academic Press .
   Google Scholar
• Perrin , D. 1972 . Codes Conjugues . Information and Control , 20 ( 3 ) April
   Google Scholar
• Perrin , D. and Perrot , J.F. 1969 . Sur les codes prefixes complets finis . C. R. Ac. Sc. Paris , 269
   Google Scholar
• Perrot , J.F. On the relationship between finite automata finite, monoids, and prefix codes . A.C.M. Symposium on theory of Computing . Northampton Mass
   Google Scholar
• Schutzenberger , M.P. 1956 . On an application of semigroup methods to some problems in coding . I.R.E. Trans. on Inf. Theory , IT2 : 47 – 60 .
   Web of Science ®Google Scholar