E. Bibliography, N. Asarin, M. Basset, A. Béal, D. Degorre et al., Toward a timed theory of channel coding, Jurdzinski and Nickovic [JN12], pp.27-42

E. Asarin, N. Basset, and A. Degorre, Spectral Gap in Timed Automata, Lecture Notes in Computer Science, vol.8053, pp.16-30, 2013.
DOI : 10.1007/978-3-642-40229-6_2
URL : https://hal.archives-ouvertes.fr/hal-00862273

E. Asarin, N. Basset, A. Degorre, and D. Perrin, Generating Functions of Timed Languages, MFCS, pp.124-135, 2012.
DOI : 10.1007/978-3-642-32589-2_14
URL : https://hal.archives-ouvertes.fr/hal-00678443

H. Paul, T. M. Algoet, and . Cover, A sandwich proof of the Shannon- McMillan-Breiman theorem. The annals of probability, pp.899-909, 1988.

[. Alur, C. Courcoubetis, and D. L. Dill, Model-checking for probabilistic real-time systems, Lecture Notes in Computer Science, vol.510, pp.115-126, 1991.
DOI : 10.1007/3-540-54233-7_128

R. Alur and D. L. Dill, A theory of timed automata, Theoretical Computer Science, vol.126, issue.2, pp.183-235, 1994.
DOI : 10.1016/0304-3975(94)90010-8

E. Asarin and A. Degorre, Volume and Entropy of Regular Timed Languages: Analytic Approach, Lecture Notes in Computer Science, vol.126, pp.13-27
DOI : 10.1016/0304-3975(94)90010-8

E. Asarin and A. Degorre, Volume and Entropy of Regular Timed Languages: Discretization Approach, Lecture Notes in Computer Science, vol.1, issue.1, pp.69-83, 2009.
DOI : 10.1007/978-0-387-49820-1

E. Asarin and A. Degorre, Two size measures for timed languages
URL : https://hal.archives-ouvertes.fr/hal-00527852

P. Aziz-abdulla, P. Krcál, and W. Yi, Sampled semantics of timed automata, Logical Methods in Computer Science, vol.6, issue.3, 2010.

E. Asarin, O. Maler, and A. Pnueli, On discretization of delays in timed automata and digital circuits, Lecture Notes in Computer Science, vol.1466, pp.470-484, 1998.
DOI : 10.1007/BFb0055642

M. Bernadsky and R. Alur, Symbolic Analysis for GSMP Models with One Stateful Clock, Lecture Notes in Computer Science, vol.4416, pp.90-103, 2007.
DOI : 10.1007/978-3-540-71493-4_10

N. Basset and E. Asarin, Thin and Thick Timed Regular Languages, Fahrenberg and Tripakis [FT11], pp.113-128
DOI : 10.1007/s00165-005-0067-8
URL : https://hal.archives-ouvertes.fr/hal-00793583

[. Burckhardt, R. Alur, and M. M. Martin, Bounded Model Checking of Concurrent Data Types on Relaxed Memory Models: A Case Study, Lecture Notes in Computer Science, vol.4144, pp.489-502, 2006.
DOI : 10.1007/11817963_45

[. Basset, Counting and generating permutations using timed languages (long version), 2013.
URL : https://hal.archives-ouvertes.fr/hal-00820373

[. Basset, A Maximal Entropy Stochastic Process for a Timed Automaton,, Lecture Notes in Computer Science, vol.7966, issue.2, pp.61-73, 2013.
DOI : 10.1007/978-3-642-39212-2_9
URL : https://hal.archives-ouvertes.fr/hal-00808909

N. Basar and . Basset, Counting and generating permutations using timed languages, Lecture Notes in Computer Science, vol.8392, p.2014

N. Baier, P. Bertrand, T. Bouyer, M. Brihaye, and . Größer, Probabilistic and Topological Semantics for Timed Automata, FSTTCS, pp.179-191, 2007.
DOI : 10.1007/978-3-540-77050-3_15
URL : https://hal.archives-ouvertes.fr/inria-00424526

N. Bertrand, P. Bouyer, T. Brihaye, and N. Markey, Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics, 2008 Fifth International Conference on Quantitative Evaluation of Systems, pp.55-64, 2008.
DOI : 10.1109/QEST.2008.19
URL : https://hal.archives-ouvertes.fr/inria-00424518

M. Béal, J. Berstel, S. Eilers, and D. Perrin, Symbolic dynamics. CoRR, abs, 1006.

P. Bouyer, T. Brihaye, M. Jurdzinski, and Q. Menet, Almost-Sure Model-Checking of Reactive Timed Automata, 2012 Ninth International Conference on Quantitative Evaluation of Systems, pp.138-147, 2012.
DOI : 10.1109/QEST.2012.10

J. Marie-pierre-béal, B. Berstel, D. Marcus, C. Perrin, P. H. Reutenauer et al., Variable-length codes and finite automata, Selected topics in information and coding theory, pp.505-584, 2010.

. Danì-ele-beauquier, Pumping Lemmas for timed automata, Lecture Notes in Computer Science, vol.1378, pp.81-94, 1998.
DOI : 10.1007/BFb0053543

[. Bernardi and O. Giménez, A Linear Algorithm for the Random Sampling from??Regular Languages, Algorithmica, vol.8, issue.1, pp.130-145, 2012.
DOI : 10.1007/s00453-010-9446-5

P. Billingsley, Probability and measure, 2012.

. Miko, S. Boja´nczykboja´nczyk, and . Lasota, A machine-independent characterization of timed languages, Automata, Languages, and Programming, pp.92-103, 2012.

R. E. Blahut, Digital Transmission of Information, 1990.

J. D. Beck, . Loera, . Develin, R. Pfeifle, and . Stanley, Coefficients and roots of Ehrhart polynomials, Contemporary Mathematics, vol.374, pp.15-36, 2005.
DOI : 10.1090/conm/374/06897

R. Bowen, Entropy for group endomorphisms and homogeneous spaces. Transactions of the, pp.401-414, 1971.

P. Bouyer and A. Petit, A Kleene/Büchi-like theorem for clock languages, Journal of Automata, Languages and Combinatorics, vol.7, issue.2, pp.167-186, 2002.

J. Berstel, D. Perrin, and C. Reutenauer, Codes and Automata , volume 129 of Encyclopedia of Mathematics and its Applications, 2009.

S. [. Beck and . Robins, Computing the continuous discretely: Integer-point enumeration in polyhedra, 2007.
DOI : 10.1007/978-1-4939-2969-6

J. Berstel and C. Reutenauer, Noncommutative rational series with applications, Enc. of Math. and Appl, vol.137, 2011.
DOI : 10.1017/CBO9780511760860
URL : https://hal.archives-ouvertes.fr/hal-00620617

M. Brin and G. Stuck, Introduction to Dynamical Systems, 2002.
DOI : 10.1017/CBO9780511755316

H. Comon and Y. Jurski, Timed Automata and the Theory of Real Numbers, Lecture Notes in Computer Science, vol.1664, pp.242-257, 1999.
DOI : 10.1007/3-540-48320-9_18

C. Dima, Real-time automata, Journal of Automata, Languages and Combinatorics, vol.6, issue.1, pp.3-24, 2001.

C. Dima, Computing reachability relations in timed automata, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science, p.177, 2002.
DOI : 10.1109/LICS.2002.1029827

K. G. David, A. Larsen, M. Legay, D. B. Mikucionis, J. Poulsen et al., Statistical Model Checking for Networks of Priced Timed Automata, Fahrenberg and Tripakis [FT11], pp.80-96
DOI : 10.1145/1755952.1755987

R. Ehrenborg and J. Jung, Descent pattern avoidance, Advances in Applied Mathematics, vol.49, issue.3-5, 2012.
DOI : 10.1016/j.aam.2012.08.004

]. M. Fek23 and . Fekete, Uber die verteilung der wurzeln bei gewissen algebraischen gleichungen mit ganzzahligen koeffizienten, Mathematische Zeitschrift, vol.17, pp.228-249, 1923.

P. Flajolet and R. Sedgewick, Analytic combinatorics, 2009.
DOI : 10.1017/CBO9780511801655
URL : https://hal.archives-ouvertes.fr/inria-00072739

P. Flajolet, P. Zimmerman, and B. Van-cutsem, A calculus for the random generation of labelled combinatorial structures, Theoretical Computer Science, vol.132, issue.1-2, pp.1-35, 1994.
DOI : 10.1016/0304-3975(94)90226-7
URL : https://hal.archives-ouvertes.fr/hal-00917729

R. Gómez and H. Bowman, Efficient Detection of Zeno Runs in Timed Automata, Lecture Notes in Computer Science, vol.4763, pp.195-210, 2007.
DOI : 10.1007/978-3-540-75454-1_15

[. Gupta, T. A. Henzinger, and R. Jagadeesan, Robust timed automata, Lecture Notes in Computer Science, vol.1201, pp.331-345, 1997.
DOI : 10.1007/BFb0014736

N. [. Hibi and . Li, Unimodular equivalence of order and chain polytopes. arXiv preprint, 2012.

T. A. Henzinger, Z. Manna, and A. Pnueli, What good are digital clocks?, Lecture Notes in Computer Science, vol.623, pp.545-558, 1992.
DOI : 10.1007/3-540-55719-9_103

A. Thomas, J. Henzinger, and . Raskin, Robust undecidability of timed and hybrid systems, Lecture Notes in Computer Science, vol.1790, pp.145-159, 2000.

]. K. Imm95 and . Immink, EFMPlus: The coding format of the multimedia compact disc, IEEE Transactions on Consumer Electronics, vol.41, issue.3, pp.491-497, 1995.

[. Kempf, M. Bozga, and O. Maler, As Soon as Probable: Optimal Scheduling under Stochastic Uncertainty, TACAS, pp.385-400, 2013.
DOI : 10.1007/978-3-642-36742-7_27

[. Kitaev, Patterns in permutations and words, 2011.

E. [. Krasnosel-'skij, A. V. Lifshits, and . Sobolev, Positive Linear Systems: The method of positive operators, Number 5 in Sigma Series in Applied Mathematics . Heldermann Verlag, 1989.

P. Krcál, Infinite Structures in Timed Systems, 2009.

V. [. Kolmogorov and . Tikhomirov, ?-entropy and ?-capacity of sets in function spaces, Uspekhi Mat. Nauk, pp.3-86, 1959.

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

]. M. Lot05 and . Lothaire, Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications), 2005.

[. Lindenstrauss and B. Weiss, Mean topological dimension, Israel Journal of Mathematics, vol.61, issue.1, pp.1-24, 2000.
DOI : 10.1007/BF02810577

P. Marchal, Generating random alternating permutations in time n log n, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00765432

O. Maler and A. Pnueli, On Recognizable Timed Languages, Lecture Notes in Computer Science, vol.2987, pp.348-362, 2004.
DOI : 10.1007/978-3-540-24727-2_25

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

A. Nijenhuis, S. Herbert, and . Wilf, Combinatorial algorithms for computers and calculators, Computer Science and Applied Mathematics, 1978.

]. W. Par64 and . Parry, Intrinsic Markov chains. Transactions of the, pp.55-66, 1964.

]. S. Pin64 and . Pinsker, Information and information stability of random variables and processes . Holden-Day series in time series analysis, 1964.

A. Puri, Dynamical properties of timed automata. Discrete Event Dynamic Systems, pp.87-113, 2000.

O. Sankur, P. Bouyer, N. Markey, and P. Reynier, Robust Controller Synthesis in Timed Automata, Lecture Notes in Computer Science, vol.8052, pp.546-560, 2013.
DOI : 10.1007/978-3-642-40184-8_38

]. C. Sha48 and . Shannon, A mathematical theory of communication, Bell Sys. Tech. J, vol.27, pp.379-423, 1948.

E. Claude and . Shannon, Prediction and entropy of printed english. Bell system technical journal, pp.50-64, 1951.

I. Simon, Factorization forests of finite height, Theoretical Computer Science, vol.72, issue.1, pp.65-94, 1990.
DOI : 10.1016/0304-3975(90)90047-L

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

]. R. Sta86 and . Stanley, Two poset polytopes, Discrete & Computational Geometry, vol.1, issue.1, pp.9-23, 1986.

R. P. Stanley, A survey of alternating permutations, Combinatorics and graphs, pp.165-196, 2010.
DOI : 10.1090/conm/531/10466

A. Stainer, Frequencies in Forgetful Timed Automata, Jurdzinski and Nickovic [JN12], pp.236-251
DOI : 10.1007/978-3-642-33365-1_17
URL : https://hal.archives-ouvertes.fr/hal-00744081

L. Sassoli and E. Vicario, Close form derivation of state-density functions over DBM domains in the analysis of non-Markovian models, Fourth International Conference on the Quantitative Evaluation of Systems (QEST 2007), pp.59-68, 2007.
DOI : 10.1109/QEST.2007.23

M. [. Schaefer and . Wolff, Topological vector spaces, 1999.

G. George and . Szpiro, The number of permutations with a given signature, and the expectations of their elements, Discrete Mathematics, vol.226, issue.1, pp.423-430, 2001.

L. Martin-de-wulf, N. Doyen, J. Markey, and . Raskin, Robust safety of timed automata. Formal Methods in System Design, pp.45-84, 2008.

L. Martin-de-wulf, J. Doyen, and . Raskin, Almost ASAP semantics: from timed models to timed implementations, Formal Aspects of Computing, vol.17, issue.3, pp.319-341, 2005.
DOI : 10.1007/s00165-005-0067-8

A. Abstract-representation-of-a and L. , 119 6.3 A ? ? : an automaton recognizing C ? ? with ? = 1, p.125

.. Timed-automata, First line: A 1 , A 2 ; second line: A 3 , A 4, p.131