Skip to Main content Skip to Navigation



 Algorithmic and combinatorial problems of complex systems

Consult your copyright

Number of Files


Nomber of Notices


Collaborations’ map


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