R. L. Adler, D. Coppersmith, and M. Hassner, Algorithms for sliding block codes---An application of symbolic dynamics to information theory, IEEE Transactions on Information Theory, vol.29, issue.1, pp.5-22, 1983.
DOI : 10.1109/TIT.1983.1056597

R. L. Adler, J. Friedman, B. Kitchens, and B. H. Marcus, State splitting for variable-length graphs (Corresp.), IEEE Transactions on Information Theory, vol.32, issue.1, pp.108-113, 1986.
DOI : 10.1109/TIT.1986.1057125

R. L. Adler, L. W. Goodwyn, and B. Weiss, Equivalence of topological Markov shifts, Israel Journal of Mathematics, vol.2, issue.1, pp.48-63, 1977.
DOI : 10.1007/BF02761605

R. Ahlswede, B. Balkenhol, and L. H. Khachatrian, Some properties of fix-free codes, Proc. 1st Int. Sem. on Coding Theory and Combinatorics, pp.20-33, 1996.

R. B. Ash, Information Theory, 1990.

M. Béal, The method of poles: a coding method for constrained channels, IEEE Transactions on Information Theory, vol.36, issue.4, pp.763-772, 1990.
DOI : 10.1109/18.53736

M. Béal, Codage symbolique, 1993.

M. Béal, Extensions of the method of poles for code construction, IEEE Transactions on Information Theory, vol.49, issue.6, pp.1516-1523, 2003.
DOI : 10.1109/TIT.2003.811920

M. Béal and D. Perrin, Codes, unambiguous automata and sofic systems, Theoretical Computer Science, vol.356, issue.1-2, pp.6-13, 2006.
DOI : 10.1016/j.tcs.2006.01.043

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

J. Berstel, D. Perrin, and C. Reutenauer, Codes and Automata, 2008.
DOI : 10.1017/CBO9781139195768
URL : https://hal.archives-ouvertes.fr/hal-00620616

J. Berstel and C. Reutenauer, Rational Series and their Languages, 1988.
DOI : 10.1007/978-3-642-73235-5
URL : https://hal.archives-ouvertes.fr/hal-00619791

V. Bruyère and M. Latteux, Variable-length maximal codes, Automata, languages and programming, pp.24-47, 1996.
DOI : 10.1007/3-540-61440-0_115

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

C. Deppe and H. Schnettler, On q-ary fix-free codes and directed deBrujin graphs, 2006 IEEE International Symposium on Information Theory, pp.1482-1485, 2006.
DOI : 10.1109/ISIT.2006.262114

J. Désarménien, La division par ordinateur des mots français: applicationàapplicationà T E X, Technique et Science Informatiques, vol.5, issue.4, pp.251-265, 1986.

T. Dutoit, An Introduction to Text-To-Speech Synthesis, 1997.
DOI : 10.1007/978-94-011-5730-8

S. Eilenberg and . Automata, Languages and Machines, volume A, 1974.

P. Elias, Universal codeword sets and representations of the integers, IEEE Transactions on Information Theory, vol.21, issue.2, pp.194-203, 1975.
DOI : 10.1109/TIT.1975.1055349

J. L. Fan, B. H. Marcus, and R. M. Roth, Lossless sliding-block compression of constrained systems, IEEE Transactions on Information Theory, vol.46, issue.2, pp.624-633, 2000.
DOI : 10.1109/18.825829

A. Peter and . Franaszek, Run-length-limited variable length coding with error propagation limitation, US Patent, vol.3689, p.899, 1972.

G. Robert, D. C. Gallager, and . Van-voorhis, Optimal source codes for geometrically distributed integer alphabets, IEEE Trans. Inform. Theory, vol.21, pp.228-230, 1975.

M. Adriano, M. L. Garsia, and . Wachs, A new algorithm for minimum cost binary trees, SIAM J. Comput, vol.6, issue.4, pp.622-642, 1977.

N. Edgar and . Gilbert, Synchronization of binary messages, IRE Trans. Inform. Theory, IT, vol.6, pp.470-477, 1960.

N. Edgar and . Gilbert, Coding with digits of unequal cost, IEEE Trans. Inform. Theory, vol.41, issue.2, pp.596-600, 1995.

N. Edgar, E. F. Gilbert, and . Moore, Variable length binary encodings, Bell System Tech. J, vol.38, pp.933-967, 1959.

D. Gillman and R. Rivest, Complete variable length fix-free codes. Designs, Codes and Cryptography, pp.109-114, 1995.

B. Girod, Bidirectionally decodable streams of prefix code-words, IEEE Communications Letters, vol.3, issue.8, pp.245-247, 1999.
DOI : 10.1109/4234.781009

M. J. Golin, C. Kenyon, and N. E. Young, Huffman coding with unequal letter costs, Proceedings of the thiry-fourth annual ACM symposium on Theory of computing , STOC '02, pp.785-791, 2002.
DOI : 10.1145/509907.510020

W. Solomon and . Golomb, Run-length encodings, IEEE Trans. Inform. Theory, IT, vol.12, pp.399-401, 1966.

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.

L. J. Guibas and A. M. Odlyzko, Maximal Prefix-Synchronized Codes, SIAM Journal on Applied Mathematics, vol.35, issue.2, pp.401-418, 1978.
DOI : 10.1137/0135034

C. D. Heegard, B. H. Marcus, and P. H. Siegel, Variable-length state splitting with applications to average runlength-constrained (ARC) codes, IEEE Transactions on Information Theory, vol.37, issue.3, pp.759-777, 1991.
DOI : 10.1109/18.79946

T. Chiang, H. , and M. Shing, Combinatorial Algorithms, 2002.

T. Chiang, H. , and A. C. Tucker, Optimal computer search trees and variablelength alphabetical codes, SIAM J. Appl. Math, vol.21, pp.514-532, 1971.

T. Chiang, H. , and P. A. Tucker, Optimal alphabetic trees for binary search, Inform. Process. Lett, vol.67, issue.3, pp.137-140, 1998.

A. David and . Huffman, A method for the construction of minimum redundancy codes

A. Kees, . Schouhamer, and . Immink, A practical method for approaching the channel capacity of constrained channels, IEEE Trans. Inform. Theory, vol.43, issue.5, pp.1389-1399, 1997.

A. Kees, . Schouhamer, and . Immink, Codes for Mass Data Storage Systems, 2004.

R. M. Karp, Minimum redundancy codes for the discrete noiseless channel, IRE Trans. Inform. Theory, issue.7, pp.27-38, 1961.

J. H. Kingston, A new proof of the Garsia-Wachs algorithm, Journal of Algorithms, vol.9, issue.1, pp.129-136, 1988.
DOI : 10.1016/0196-6774(88)90009-0

E. Donald and . Knuth, The Art of Computer Programming, Volume III: Sorting and Searching, 1998.

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

M. Lothaire, Applied Combinatorics on Words, volume 105 of Encyclopedia of Mathematics and its Applications, 2005.

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

R. J. Mceliece, The Theory of Information and Coding, volume 86 of Encyclopedia of Mathematics and its Applications, 2004.

K. Mehlhorn, An efficient algorithm for constructing nearly optimal prefix codes, IEEE Transactions on Information Theory, vol.26, issue.5, pp.513-517, 1980.
DOI : 10.1109/TIT.1980.1056250

N. Merhav, G. Seroussi, and M. J. Weinberger, Optimal prefix codes for sources with two-sided geometric distributions, IEEE Transactions on Information Theory, vol.46, issue.1, pp.121-135, 2000.
DOI : 10.1109/18.817513

D. Perrin and M. Schützenberger, Synchronizing prefix codes and automata and the road coloring problem, Symbolic dynamics and its applications, pp.295-318, 1991.
DOI : 10.1090/conm/135/1185096

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

C. Reutenauer, Ensembles libres de chemins dans un graphe, Bulletin de la Société mathématique de France, vol.79, issue.2, pp.135-152, 1986.
DOI : 10.24033/bsmf.2051

R. F. Rice, Some practical universal noiseless coding techniques, 1979.
DOI : 10.1117/12.958253

I. Richardson, 264 and MPEG-4 Video Compression: Video Coding for Nextgeneration Multimedia, 2003.
DOI : 10.1002/0470869615

J. Sakarovitch, Elements of Automata Theory, 2008.
DOI : 10.1017/CBO9781139195218

D. Salomon, Variable-Length Codes for Data Compression, 2007.
DOI : 10.1007/978-1-84628-959-0

M. Schützenberger, On an application of semigroup methods to some problems in coding, IRE Trans. Inform. Theory, issue.2, pp.47-60, 1956.

M. Schützenberger, On a family of submonoids, Publ. Math. Inst. Hungar. Acad. Sci, pp.381-391, 1961.

M. Schützenberger, On a Special Class of Recurrent Events, The Annals of Mathematical Statistics, vol.32, issue.4, pp.1201-1213, 1961.
DOI : 10.1214/aoms/1177704860

C. E. Shannon, A Mathematical Theory of Communication, Bell System Technical Journal, vol.27, issue.3, pp.379-423, 1948.
DOI : 10.1002/j.1538-7305.1948.tb01338.x

W. Peter and . Shor, A counterexample to the triangle conjecture, J. Combin. theory Ser. A, vol.38, pp.110-112, 1983.

J. Teuhola, A compression method for clustered bit-vectors, Information Processing Letters, vol.7, issue.6, pp.308-311, 1978.
DOI : 10.1016/0020-0190(78)90024-8

A. N. Trahtman, The road coloring problem, Israel Journal of Mathematics, vol.17, issue.1, 2008.
DOI : 10.1007/s11856-009-0062-5

B. Parker and T. , Synthesis of noiseless compression codes, 1967.

B. Varn, Optimal variable length codes (arbitrary symbol cost and equal code word probability), Information and Control, vol.19, issue.4, pp.289-301, 1971.
DOI : 10.1016/S0019-9958(71)90155-0

J. Wen and J. Villasenor, Reversible variable length codes for efficient and robust image and video coding, Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225), pp.471-480, 1998.
DOI : 10.1109/DCC.1998.672209

M. Wada, Y. Takishima, and H. Murakami, Reversible variable length codes, IEEE Trans. Comm, vol.43, pp.158-162, 1995.

C. Ye and R. W. Yeung, Some basic properties of fix-free codes, IEEE Trans. Inform. Theory, vol.47, issue.1, pp.72-87, 2001.

S. Yekhanin, Improved Upper Bound for the Redundancy of Fix-Free Codes, IEEE Transactions on Information Theory, vol.50, issue.11, pp.2815-2818, 2004.
DOI : 10.1109/TIT.2004.836703