M. Béal and D. Perrin, Codes and sofic constraints, Theoretical Computer Science, vol.340, issue.2, pp.381-393, 2005.
DOI : 10.1016/j.tcs.2005.03.033

M. Béal and D. Perrin, Complete codes in sofic systemsTo appear, p.6

. Ch and . Reutenauer, Ensembles libres de chemins dans un graphe, Bull. Soc. Math. France, vol.114, issue.2, pp.135-152, 1986.

A. Restivo, Codes and local constraints, Theoretical Computer Science, vol.72, issue.1, pp.55-64, 1990.
DOI : 10.1016/0304-3975(90)90046-K

J. Ashley, B. Marcus, D. Perrin, and S. , Surjective Extensions of Sliding-Block Codes, SIAM Journal on Discrete Mathematics, vol.6, issue.4, pp.582-611, 1993.
DOI : 10.1137/0406046

M. Dalai and R. Leonardi, Non prefix-free codes for constrained sequences, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005., pp.1534-1538, 2005.
DOI : 10.1109/ISIT.2005.1523601
URL : http://arxiv.org/abs/cs/0506036

G. Gönenç, Unique decipherability of codes with constraints with application to syllabification of Turkish words, COLING 1973: Computational And Mathematical Linguistics: Proceedings of the International Conference on Computational Linguistics, pp.183-193, 1973.

D. A. Lind and B. H. Marcus, An Introduction to Symbolic Dynamics and Coding, 1995.
DOI : 10.1017/CBO9780511626302
URL : http://dx.doi.org/10.1016/0898-1221(96)87345-7

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

M. Béal and D. Perrin, Symbolic Dynamics and Finite Automata, pp.463-505, 1997.
DOI : 10.1007/978-3-662-07675-0_10

M. Béal, M. Crochemore, F. Mignosi, A. Restivo, and M. Sciortino, Computing forbidden words of regular languages, Fund, Inform, vol.56, issue.12, pp.121-135, 2003.

A. Restivo, On codes having no finite completions, Discrete Math, pp.309-316, 1977.