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