Infinite words Two dimension words Minimal SFT Symbolic dynamics Expanders Automates cellulaires Computability history Algorithmic statistics Finite-state dimension Effective Hausdorff dimension Entropie de Shannon Combinatorics on words Subword complexity Block complexity Linear complexity Conditional inequalities Busy beavers Morphisms Information Theory Critical exponent Calculabilité 2D Dynamique symbolique Ammann tilings Aperiodicity Formal languages Almost entropic points Complexity of majorants Algorithmic information theory Aperiodic tilings Conditional information inequalities OBDD Mutual information Conditional probability Generic algorithms Computational modeling Biclique cover Palindromes Biological system modeling Algorithms Halting problem Democritus physics Algorithmique du texte Secret key agreement Langages formels Tilings S-adic conjecture Entropy Dual-mode lasers Morphism Cellular automata Pavages Edge coloring Factor complexity Information inequalities Sturmian words Diagonally non-computable functions Tseitin formulas Corpuscular concepts Generalizations of Sturmian words Carnot principle Cellular automaton Factorization D0L systems Computation power Shannon entropy Communication complexity Quasiperiodicity Nanolaser Birkhoff's ergodic theorem Coding theory Kolmogorov complexity Error-correcting codes Repetitions Canonical single-corpuscle thermodynamics Algorithmic learning theory Cellular automata computation model generalization Combinatorics Arithmetical hierarchy Algorithmic randomness Computable functions Dual-mode laser Classical gas theory Semiconductor lasers Uniform recurrence Universalité Complexité de Kolmogorov Dynamique directionnelle S-adicity Atmospheric modeling Combinatorics on Words Proof complexity Quasiperiodic Computability Ideal gas law Palindromic length Normal sequences Automata Analytical models Kolmogorov Complexity