R. 1. Berstel, J. Perrin, and D. , Theory of Codes, 1985.
URL : https://hal.archives-ouvertes.fr/hal-00619780

J. Devolder, M. Latteux, I. Litovsky, and L. Staiger, Codes and infinite words, Acta Cybernetica, vol.11, issue.4, pp.241-256, 1994.

L. Staiger, On infinitary finite length codes, RAIRO - Theoretical Informatics and Applications, vol.20, issue.4, pp.483-494, 1986.
DOI : 10.1051/ita/1986200404831

D. L. Van, Contribution to Combinatorics on Words, 1985.

M. Mohri, F. Pereira, and M. Riley, Speech recognition with weighted finite-state transducers, 2007.
DOI : 10.1007/978-3-540-49127-9_28

J. Devolder and E. Timmerman, Finitary codes for biinfinite words, RAIRO - Theoretical Informatics and Applications, vol.26, issue.4, pp.363-386, 1992.
DOI : 10.1051/ita/1992260403631
URL : http://www.numdam.org/article/ITA_1992__26_4_363_0.pdf

D. L. Van, N. H. Lam, and P. T. Huy, On codes concerning bi-infinite words, Acta Cybernetica, vol.11, issue.12, pp.97-109, 1993.

N. H. Lam and D. L. Van, On a class of infinitary codes, Theoretical Infomatics and Applications, vol.24, pp.441-458, 1990.

M. Madonia, S. Salemi, and T. Sportelli, A generalization of Sardinas and Patterson's algorithm to z-codes, Theoretical Computer Science, vol.108, issue.2, pp.251-270, 1993.
DOI : 10.1016/0304-3975(93)90193-W

T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2009.

A. Restivo, Codes and automata, Lecture Notes in Comput. Sci, vol.386, pp.186-198, 1989.
DOI : 10.1007/BFb0013121