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


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