J. Moon and B. Brickner, Maximum transition run codes for data storage systems, IEEE Transactions on Magnetics, vol.32, issue.5, pp.3992-3994, 1996.
DOI : 10.1109/20.539241

A. Wijngaarden and K. S. Immink, Maximum runlength-limited codes with error control capabilities, IEEE Journal on Selected Areas in Communications, vol.19, issue.4, pp.602-611, 2001.
DOI : 10.1109/49.920169

J. Campello-de-souza, B. H. Marcus, R. New, and B. A. Wilson, Constrained systems with unconstrained positions, IEEE Transactions on Information Theory, vol.48, issue.4, pp.866-879, 2002.
DOI : 10.1109/18.992774

B. H. Marcus, R. M. Roth, and P. H. Siegel, Constrained systems and coding for recording channels, Handbook of Coding Theory, pp.1635-1764, 1998.

B. E. Moision and P. H. Siegel, Periodic-finite-type shift spaces, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252), p.65, 2001.
DOI : 10.1109/ISIT.2001.935928

URL : https://hal.archives-ouvertes.fr/hal-00619782

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

M. Crochemore, F. Mignosi, and A. Restivo, Automata and forbidden words, Information Processing Letters, vol.67, issue.3, pp.111-117, 1998.
DOI : 10.1016/S0020-0190(98)00104-5

URL : https://hal.archives-ouvertes.fr/hal-00619578

M. Crochemore, F. Mignosi, A. Restivo, and S. Salemi, Data compression using antidictionaries, Proceedings of the IEEE Lossless Data Compression, J. Storer, pp.1756-1768, 2000.
DOI : 10.1109/5.892711

URL : https://hal.archives-ouvertes.fr/hal-00619579

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

A. Blumer, J. Blumer, A. Ehrenfeucht, D. Haussler, and R. Mcconnell, Linear size finite automata for the set of all subwords of a word : an outline of results, Bull. European Assoc. Theoret. Comput. Sci, issue.21, pp.12-20, 1983.