D. Arqu-es and C. Michel, A Complementary Circular Code in the Protein Coding Genes, Journal of Theoretical Biology, vol.182, issue.1, pp.45-58, 1996.
DOI : 10.1006/jtbi.1996.0142

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

S. Kim and R. Mcnaughton, Computing the Order of a Locally Testable Automaton, SIAM Journal on Computing, vol.23, issue.6, pp.1193-1215, 1994.
DOI : 10.1137/S0097539791216987

S. Kim, R. Mcnaughton, and R. Mccloskey, A polynomial time algorithm for the local testability problem of determinitic nite automata, I.E.E.E. Trans. Comput, vol.40, pp.382-420, 1989.

D. Lind and B. Marcus, An Introduction to Symbolic Dynamics and Coding, 1995.
DOI : 10.1017/CBO9780511626302

A. D. Luca and A. Restivo, A characterization of strictly locally testable languages and its application to subsemigroups of a free semigroup, Information and Control, vol.44, issue.3, pp.300-319, 1980.
DOI : 10.1016/S0019-9958(80)90180-1

B. Marcus, P. Siegel, and J. Wolf, Finite-state modulation codes for data storage, IEEE Journal on Selected Areas in Communications, vol.10, issue.1, pp.5-37, 1992.
DOI : 10.1109/49.124467

M. Perles, M. O. Rabin, and E. Shamir, The theory of deenite automata, I.E.E.E. Trans. Electr. Comp., EC, vol.12, pp.233-243, 1963.