index - Archive ouverte HAL Access content directly



 Algorithmic and combinatorial problems of complex systems

Consult your copyright

Number of Files


Nomber of Notices


Collaborations’ map


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