Skip to Main content Skip to Navigation
New interface



 Algorithmic and combinatorial problems of complex systems

Consult your copyright

Number of Files


Nomber of Notices


Collaborations’ map


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