1. J. BERSTEL, D. PERRIN, “Theory of codes”, Academic Press, 1985.
2. V. BRUYERE, Completion of codes with finite deciphering delay, in preparation.
3. C. CHOFFRUT, Une caractérisation des codes à délai borné par leur fonction de décodage, In ”Théorie des codes” (D. Perrin Ed.) LITP.
4. A. EHRENFEUCHT, G. ROZENBERG, Elementary homomorphisms and a solution to the DOL sequence equivalence problem, Theoret. Comput. Sci. 7, 1978, 169–183.
5. A. EHRENFEUCHT, G. ROZENBERG, Each regular code is included in a regular maximal code, RAIRO Informat. Theor., 1983, 89–96.