R. L. Adler, D. Coppersmith, and A. M. Hassner, Algorithms for sliding block codes, IEEE Trans. Inform. Theory, IT, pp.29-34, 1983.

A. V. Aho, J. E. Hopcroft, and A. J. Ullman, The Design and Analysis of Computer Algorithms, 1974.

M. Eal and A. D. Perrin, Symbolic dynamics and finite automata, Handbook of formal languages, pp.463-505, 1997.

M. Boyle, B. P. Kitchens, and A. B. Marcus, A note on minimal covers for sofic shifts, Proc. Amer, pp.95-403, 1985.

J. Cai and R. Paige, Using multiset discrimination to solve language processing problems without hashing, Theoretical Computer Science, vol.145, issue.1-2, pp.189-228, 1995.
DOI : 10.1016/0304-3975(94)00183-J

T. H. Cormen, C. E. Leiserson, R. L. Rivest, and A. C. Stein, Introduction to algorithms, 2001.

J. E. Hopcroft, AN n log n ALGORITHM FOR MINIMIZING STATES IN A FINITE AUTOMATON, Theory of Machines and Computations, pp.189-196, 1971.
DOI : 10.1016/B978-0-12-417750-5.50022-1

R. H. Karabed-and-b and . Marcus, Sliding-block coding for inputrestricted channels, IEEE Trans. Inform. Theory, IT, pp.34-36, 1988.

B. P. Kitchens, Symbolic Dynamics: one-sided, two-sided and countable state Markov shifts, 1997.
DOI : 10.1007/978-3-642-58822-8

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

B. H. Marcus, Sofic systems and encoding data, IEEE Transactions on Information Theory, vol.31, issue.3, pp.31-266, 1985.
DOI : 10.1109/TIT.1985.1057037

M. Nasu, An invariant for bounded-to-one factor maps between transitive sofic subshifts, Ergodic Theory Dynam, Systems, vol.5, pp.89-105, 1985.

R. Paige and R. E. Tarjan, Three Partition Refinement Algorithms, SIAM Journal on Computing, vol.16, issue.6, pp.973-989, 1987.
DOI : 10.1137/0216062

M. Perles, M. O. Rabin, and A. E. Shamir, The Theory of Definite Automata, IEEE Transactions on Electronic Computers, vol.12, issue.3, pp.12-233, 1963.
DOI : 10.1109/PGEC.1963.263534

D. Revuz, Minimisation of acyclic deterministic automata in linear time, Theoretical Computer Science, vol.92, issue.1, pp.181-189, 1990.
DOI : 10.1016/0304-3975(92)90142-3
URL : https://hal.archives-ouvertes.fr/hal-00619678