K. A. Immink, P. H. Siegel, and J. K. Wolf, Codes for digital recorders, IEEE Transactions on Information Theory, vol.44, issue.6, pp.2260-2299, 1998.
DOI : 10.1109/18.720539

W. Bliss, An 8/9 rate time-varying trellis code for high density magnetic recording, IEEE Transactions on Magnetics, vol.33, issue.5, pp.2746-2748, 1997.
DOI : 10.1109/20.617717

K. K. Fitzpatrick and C. S. Modlin, Time-varying MTR codes for high density magnetic recording, GLOBECOM 97. IEEE Global Telecommunications Conference. Conference Record, pp.1250-1253, 1997.
DOI : 10.1109/GLOCOM.1997.644335

B. E. Moision, P. H. Siegel, and E. Soljanin, Distance-enhancing codes for digital recording, IEEE Transactions on Magnetics, vol.34, issue.1, pp.69-74, 1998.
DOI : 10.1109/20.663448

R. Karabed, P. H. Siegel, and E. Soljanin, Constrained coding for binary channels with high intersymbol interference, IEEE Transactions on Information Theory, vol.45, issue.6, pp.1777-1797, 1999.
DOI : 10.1109/18.782099

R. Karabed and P. H. Siegel, Coding for higher order partial response channels, Proc. SPIE, pp.92-102, 1995.

E. Soljanin, <title>On-track and off-track distance properties of Class 4 partial response channels</title>, Coding and Signal Processing for Information Storage, pp.92-102, 1995.
DOI : 10.1117/12.228220

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

L. Poo and B. H. Marcus, Time-Varying Maximum Transition Run Constraints, IEEE Transactions on Information Theory, vol.52, issue.10, pp.4464-4480, 2006.
DOI : 10.1109/TIT.2006.881706

A. J. Van-wijngaarden and K. A. 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. C. 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

T. L. Poo, P. Chaichanavong, and B. H. Marcus, Tradeoff functions for constrained systems with unconstrained positions, IEEE Transactions on Information Theory, vol.52, issue.4, pp.1425-1449, 2006.
DOI : 10.1109/TIT.2006.871614

M. Béal, M. Crochemore, and G. Fici, Presentations of Constrained Systems With Unconstrained Positions, IEEE Transactions on Information Theory, vol.51, issue.5, pp.1891-1900, 2005.
DOI : 10.1109/TIT.2005.846423

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

B. E. Moision and P. H. Siegel, Periodic-finite-type shift spaces, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)
DOI : 10.1109/ISIT.2001.935928
URL : https://hal.archives-ouvertes.fr/hal-00619782

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

B. H. Marcus, R. M. Roth, and P. H. Siegel, Constrained systems and coding for recording channels, Handbook of Coding Theory, p.20, 1998.

Z. A. Khayrallah and D. L. Neuhoff, Shift spaces encoders and decoders

L. J. Guibas and A. M. Odlyzko, String overlaps, pattern matching, and nontransitive games, Journal of Combinatorial Theory, Series A, vol.30, issue.2, pp.183-208, 1981.
DOI : 10.1016/0097-3165(81)90005-4

C. Pimentel and B. F. Uchôa-filho, A combinatorial approach to finding the capacity of the discrete noiseless channel, IEEE Transactions on Information Theory, vol.49, issue.8, pp.2024-2028, 2003.
DOI : 10.1109/TIT.2003.814486

J. E. Hopcroft and L. D. Ullman, Introduction to Automata Theory, Languages, and Computation, 1979.

M. Béal, F. Mignosi, A. Restivo, and M. Sciortino, Forbidden Words in Symbolic Dynamics, Advances in Applied Mathematics, vol.25, issue.2, pp.163-193, 2000.
DOI : 10.1006/aama.2000.0682

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. Sciortino, Automata, Forbidden Words and Applications to Symbolic Dynamics and Fragment Assembly, 2001.

R. Karabed and B. H. Marcus, Sliding-block coding for input-restricted channels, IEEE Transactions on Information Theory, vol.34, issue.1, pp.2-26, 1988.
DOI : 10.1109/18.2597

A. Manada and N. Kashyap, On the period of a periodic-finite-type shift, 2008 IEEE International Symposium on Information Theory, pp.1453-1457, 2008.
DOI : 10.1109/ISIT.2008.4595228

D. Knuth, Strong components, Comput. Sci. Dep. Stanford Univ, 1973.

Y. Balcer, A. F. Veinott, and J. , Computing a graph's period quadratically by node condensation, Discrete Mathematics, vol.4, issue.4, pp.295-303, 1973.
DOI : 10.1016/0012-365X(73)90166-0

M. Béal, M. Crochemore, and L. Gasieniec, Tries accepting periodic forbidden words, 2007.

I. P. Goulden and D. M. Jackson, An Inversion Theorem for Cluster Decompositions of Sequences with Distinguished Subsequences, Journal of the London Mathematical Society, vol.2, issue.3, pp.567-576, 1979.
DOI : 10.1112/jlms/s2-20.3.567

P. Flajolet and R. Sedgewick, Analytic Combinatorics Book in preparation, (672 p.+x. Version of, 2005.

J. Noonan and D. Zeilberger, The Goulden???Jackson cluster method: extensions, applications and implementations, Journal of Difference Equations and Applications, vol.7, issue.4-5, pp.355-377, 1999.
DOI : 10.1016/0097-3165(81)90005-4

N. T. Sindhushayana, Symbolic dynamics and automata theory, with applications to constraint coding, 1993.

P. A. Mcewen, Trellis Coding for Partial Response Channels, 1999.

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

B. E. Moision, A. Orlitsky, and P. H. Siegel, On codes that avoid specified differences, IEEE Transactions on Information Theory, vol.47, issue.1, pp.433-442, 2001.
DOI : 10.1109/18.904557
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.38.7517