. L. Bibliographie-[-ach83-]-r, D. Adler, M. Coppersmith, and . Hassner, Algorithms for sliding block codes, I.E.E.E. Trans. Inform. Theory, IT, vol.29, pp.5-22, 1983.

D. Arqù-es, J. Fallot, and C. Michel, An evolutionnary model of a complementary circular code, J. of Theoret. Biology, 1996.

D. Arqù-es and C. Michel, A possible code in the genetic code, STACS 95, pp.640-651, 1995.
DOI : 10.1007/3-540-59042-0_112

D. Arqù-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

F. Bassino, Star-height of an N-rational series, STACS 96, pp.125-135
DOI : 10.1007/3-540-60922-9_11
URL : https://hal.archives-ouvertes.fr/hal-00619857

F. Bassino, Nonnegative companion matrices and star-height of N-rational series, Theoretical Computer Science, vol.180, issue.1-2, 1997.
DOI : 10.1016/S0304-3975(96)00106-5
URL : https://hal.archives-ouvertes.fr/hal-00619332

D. [. Boyle and . Handelman, The Spectra of Nonnegative Matrices Via Symbolic Dynamics, The Annals of Mathematics, vol.133, issue.2, pp.249-316, 1991.
DOI : 10.2307/2944339

M. [. Bruyère and . Latteux, Variable-length maximal codes, Lect. Notes in Comput. Sci, vol.96, issue.1099, pp.24-47, 1996.
DOI : 10.1007/3-540-61440-0_115

J. Berstel and M. Mignotte, Deux propri??t??s d??cidables des suites r??currentes lin??aires, Bulletin de la Société mathématique de France, vol.79, 1975.
DOI : 10.24033/bsmf.1823

M. Boyle, Symbolic Dynamics and Matrices, Combinatorial and Graph-Theoretic Problems in Linear Algebra Mathematics and Its Applications, 1994.
DOI : 10.1007/978-1-4613-8354-3_1
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.42.8224

R. [. Berman and . Plemmons, Nonnegative matrices in mathematical sciences, 1979.
DOI : 10.1137/1.9781611971262

D. [. Berstel and . Perrin, Theory of codes, Pure and Applied Mathematics, 1985.
URL : https://hal.archives-ouvertes.fr/hal-00619780

C. [. Berstel and . Reutenauer, Recognizable formal power series on trees, Theoretical Computer Science, vol.18, issue.2, pp.115-148, 1982.
DOI : 10.1016/0304-3975(82)90019-6
URL : https://hal.archives-ouvertes.fr/hal-00619497

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

J. [. Carter and . Gill, Conjectures on uniquely decipherable codes (Corresp.), IEEE Transactions on Information Theory, vol.20, issue.3, pp.394-396, 1974.
DOI : 10.1109/TIT.1974.1055218

H. C. Crick, J. S. Griffith, and L. E. Orgel, CODES WITHOUT COMMAS, Proceedings of the National Academy of Sciences, vol.43, issue.5, pp.416-421, 1957.
DOI : 10.1073/pnas.43.5.416

J. H. Conway, Regular algebra and finite machine, 1971.

R. Cori, Un code pour les graphes planaires et ses applications, 1975.

N. Cot, Combinatoire des arbres t-aires dont les branches ont des coûts positifs quelconques, Thèse d'Etat, 1980.

A. [. Carlyle and . Paz, Realizations by stochastic finite automata, Journal of Computer and System Sciences, vol.5, issue.1, pp.26-40, 1971.
DOI : 10.1016/S0022-0000(71)80005-3

M. [. Chomsky and . Schützenberger, The algebraic theory of context-free languages, Computer programming and formal systems, pp.118-161, 1963.

]. I. Csi69 and . Csiszar, Simple proofs of some theorems on noiseless channels, Inform. and Control, vol.14, pp.185-198, 1969.

M. [. Dejean and . Schützenberger, On a question of Eggan, Information and Control, vol.9, issue.1, pp.23-25, 1966.
DOI : 10.1016/S0019-9958(66)90083-0

J. [. Duchamp and . Thibon, Bisections reconnaissables, RAIRO - Theoretical Informatics and Applications, vol.22, issue.1, pp.113-128, 1988.
DOI : 10.1051/ita/1988220101131

L. C. Eggan, Transition graphs and star height of regular events. Michigan Math, J, vol.10, pp.385-397, 1963.

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

G. [. Ehrenfeucht and . Rozenberg, Each regular code is included in a maximal regular code, RAIRO - Theoretical Informatics and Applications, vol.20, issue.1, pp.89-96, 1985.
DOI : 10.1051/ita/1986200100891

]. P. Fat04 and . Fatou, Sur les sériesentì eresàeresà coefficients entiers, pp.342-344, 1904.

]. M. Fli74 and . Fliess, Matrices de Hankel, J. Math. Pures Appl, vol.53, pp.197-222, 1965.

]. M. Fli75 and . Fliess, Séries rationnelles positives et processus stochastiques, Annales Institut H. Poincaré, Sect. B, vol.11, issue.2, pp.1-21, 1975.

]. M. Fli81 and . Fliess, Fonctionnelles causales non linéaires et indéterminées non commutatives, Bull. Soc. Math. France, vol.109, pp.3-40, 1981.

]. G. Fro12 and . Frobenius, ¨ Uber matrizen aus nicht negativen elementen

. Akad-der-wiss, . [. Berlin, J. M. Flajolet, and . Steyaert, Patterns and pattern-matching in trees : an analysis, Inform. and Control, vol.58, pp.456-47719, 1912.

]. F. Gan59 and . Gantmacher, The theory of matrices, 1959.

B. [. Golomb and . Gordon, Codes with bounded synchronization delay, Information and Control, vol.8, issue.4, pp.355-372, 1965.
DOI : 10.1016/S0019-9958(65)90300-1

B. [. Golomb, L. R. Gordon, and . Welch, Comma-free codes, Journal canadien de math??matiques, vol.10, issue.0, pp.202-209, 1958.
DOI : 10.4153/CJM-1958-023-9

D. E. Handelman, Positive matrices and dimension groups affiliated to C ? algebras and topological Markov chains, J.Operator Theory, vol.6, pp.55-74, 1981.

D. E. Handelman, Positive polynomials and product type action of compact groups. Memoirs of the A, 1985.

D. E. Handelman, Spectral radii of primitive integral companion matrices and log concave polynomials, Symbolic Dynamic and its Applications, pp.231-238, 1992.
DOI : 10.1090/conm/135/1185092

]. K. Has79 and . Hashiguchi, A decision procedure for the order of regular events, Theoret .Comput.Sci, vol.8, pp.69-72, 1979.

K. Hashiguchi, Regular languages of star height one, Information and Control, vol.53, issue.3, pp.199-210, 1982.
DOI : 10.1016/S0019-9958(82)91028-2

K. Hashiguchi, Algorithms for determining relative star height and star height, Information and Computation, vol.78, issue.2, pp.124-169, 1988.
DOI : 10.1016/0890-5401(88)90033-8

K. Hashiguchi, Relative star height, star height and finite automata with distance functions, Lect. Notes in Comput. Sci, vol.386, pp.74-88, 1989.
DOI : 10.1007/BFb0013113

D. A. Huffman, A method for the construction of minimal redundancy codes, Proc. IRE, pp.1098-1101, 1952.

R. M. Karp, Minimum-redundancy coding for the discret noiseless channels, IRE Trans. Inform. Theory, IT, vol.17, issue.1, pp.27-38, 1961.

]. S. Kle56 and . Kleene, Representation of events in nerve nets and finite automata, Automata Studies, pp.3-41, 1956.

T. Katayama, M. Okamoto, and H. Enomoto, Characterization of the structure-generating functions of regular sets and the DOL growth functions, Information and Control, vol.36, issue.1, pp.85-101, 1978.
DOI : 10.1016/S0019-9958(78)90247-4

R. M. Krause, Channels which transmit letters of unequal duration, Information and Control, vol.5, issue.1, pp.13-24, 1962.
DOI : 10.1016/S0019-9958(62)90183-3

D. Krob, Codes limites et factorisations finies du mono??de libre, RAIRO - Theoretical Informatics and Applications, vol.21, issue.4, pp.437-467, 1987.
DOI : 10.1051/ita/1987210404371

D. Krob, Complete systems ofB-rational identities, Theoretical Computer Science, vol.89, issue.2, pp.207-343, 1991.
DOI : 10.1016/0304-3975(91)90395-I
URL : http://doi.org/10.1016/0304-3975(91)90395-i

D. Krob, Expressions rationnelles sur un anneau, Topics in invariant theory, pp.215-243, 1991.
DOI : 10.1016/0021-8693(66)90004-4

D. Krob, DIFFERENTIATION OF K-RATIONAL EXPRESSIONS, International Journal of Algebra and Computation, vol.02, issue.01, pp.57-87, 1992.
DOI : 10.1142/S0218196792000062
URL : https://hal.archives-ouvertes.fr/hal-00017310

]. A. Lin68 and . Lindenmayer, Mathematicals models for cellular interaction in development, i and ii, J. Theor. Biol, vol.18, pp.280-315, 1968.

]. D. Lin84 and . Lind, The entropies of topological Markov shifts and a related class of algebraic integers, Ergod. Th. and Dynam. Syst, vol.4, pp.283-300, 1984.

B. [. Lind and . Marcus, An introduction to symbolic dynamics and coding, 1995.
DOI : 10.1017/CBO9780511626302

G. Longo, A Noiseless Coding Theorem for Sources Having Utilities, SIAM Journal on Applied Mathematics, vol.30, issue.4, 1976.
DOI : 10.1137/0130067

]. M. Lot83 and . Lothaire, Combinatorics on Words, of Encyclopedia of Mathematics and its Applications, 1983.

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

B. Mcmillan, Two inequalities implied by unique decipherability, IEEE Transactions on Information Theory, vol.2, issue.4, pp.115-116, 1956.
DOI : 10.1109/TIT.1956.1056818

]. R. Mcn67 and . Mcnaughton, The loop complexity of pure-group events, Inform. and Control, vol.11, pp.167-176, 1967.

]. H. Min88 and . Minc, Nonnegative matrices Wiley Inter-Sciences, 1988. [Per07] O. Perron. Zur theorie der matrizen, Math. Ann, vol.64, pp.248-263, 1907.

]. D. Per89 and . Perrin, Arbres et séries rationnelles, C. R. A. S. Paris, Série I, vol.309, pp.713-716, 1989.

]. D. Per90 and . Perrin, Finite automata, pp.1-57, 1990.

]. D. Per92 and . Perrin, On positive matrices, Theoret.Comput.Sci, vol.94, pp.357-366, 1992.

]. Pin95 and . Pin, Tropical semirings, LITP, vol.40, 1995.
DOI : 10.1017/CBO9780511662508.004

]. H. Poi83 and . Poincaré, Sur leséquationsleséquations algébriques, pp.1418-1419, 1883.

C. Reutenauer, S??ries formelles et alg??bres syntactiques, Journal of Algebra, vol.66, issue.2, pp.448-483, 1980.
DOI : 10.1016/0021-8693(80)90097-6

C. Reutenauer, Inversion height in free fields, Selecta Mathematica, vol.4, issue.1, pp.1-18, 1996.
DOI : 10.1007/BF01587940

A. [. Rozenberg and . Soittola, The mathematical theory of L-systems, 1980.

]. A. Sal90 and . Salomaa, Formal languages and power series, pp.104-132, 1990.

]. M. Sch56 and . Schützenberger, Une théorie algébrique du codage, pp.1955-1956

]. M. Sch61 and . Schützenberger, On the definition of a family of automata, Inform. and Contr, vol.4, pp.245-270, 1961.

M. P. Schützenberger, On a factorization of free monoids, Proc. Amer, pp.21-24, 1965.

M. P. Schützenberger, Sur une question concernant certains sous-mono¨?desmono¨?des libres, pp.2419-2420, 1965.

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

I. Simon, Limited subsets of a free monoid, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978), pp.143-150, 1978.
DOI : 10.1109/SFCS.1978.21

]. M. Soi76 and . Soittola, Positive rational sequences, Theoret.Comput.Sci, vol.2, pp.317-322, 1976.

M. [. Salomaa and . Soittola, Automata-theoretic aspect of formal power series, 1978.
DOI : 10.1007/978-1-4612-6264-0

]. R. Sta86 and . Stanley, Enumerative Combinatorics, volume I, 1986.

]. R. Sta89 and . Stanley, Log-concave and unimodal sequences in algebra, combinatorics and geometry, Graph theory and its applications: East and West, number 576 in Annals of the New-York Academy of Sciences, pp.500-535, 1989.

G. Viennot, Algèbres de Lie libres et mono¨?desmono¨?des libres, Thèse d'Etat, 1974.

]. G. Vie78 and . Viennot, Algèbres de Lie libres et mono¨?desmono¨?des libres, Number 691 in Lect. Notes in Math, 1978.

.. De-fibonacci, Automate des termes d'indice pair de la série, p.82