Aperiodic tilings Symbolic dynamics Finite-state dimension Expander mixing lemma Langages formels Real time Kolmorogov complexity Factorization Expanders Combinatorics on Words Analytical models Uniform recurrence Communication complexity Algorithmic complexity Biological system modeling Algorithms Secret sharing Aperiodicity Atmospheric modeling Morphisms Biclique cover Repetitions Quasiperiodicity Universalité Almost entropic points OBDD Copy lemma Tilings Combinatorial game Nanolaser Information Theory Cellular automata Palindromes Non-Shannon-type information inequalities Tseitin formulas Algorithmic statistics Clusters Algorithmique du texte Busy beavers Minimal SFT Halting problem Semiconductor lasers Two dimension words Algorithmic learning theory Shannon entropy Classical gas theory Proof complexity Algorithmic information theory Linear complexity Canonical single-corpuscle thermodynamics Carnot principle Bilinear systems S-adic conjecture Cellular automaton Sturmian words Cellular automata computation model generalization Information inequalities Generic algorithms Combinatorics on words Factor complexity Block complexity Kolmogorov Complexity Ideal gas law Ammann tilings Palindromic length Formal languages Arithmetical hierarchy Calculabilité Bilinear maps 2D Pavages Computability Kolmogorov structure function Automates cellulaires Morphism Mutual information Corpuscular concepts Logic Quasiperiodic Birkhoff's ergodic theorem Error-correcting codes Complexité de Kolmogorov Automata Algorithmic randomness Generalizations of Sturmian words Entropy region Secret key agreement Entropy S-adicity Coding theory Symmetries Sofic shifts Kolmogorov complexity Linear programming Algorithm Infinite words Random bits Information-theoretic cryptography Subword complexity Normal sequences