Loading...
The research topics of the ESCAPE team cover a wide range of theoretical discrete complex systems and computational models (tilings, cellular automata, infinite words, etc.). We study the connections between these objects and the many notions of complexity associated (algorithmic, descriptive, combinatorial, etc.). We are particularly interested in using results and techniques that were developped for the study of one such object to obtain new insight into the properties of another..
Open Access Files
93 %
Number of full texts
132
Number of records
45
Publishers' policy on open archives
Mapping of collaborations
Tags
Communication complexity
Complexité de Kolmogorov
Minimal SFT
Carnot principle
Almost entropic points
Biological system modeling
Ideal gas law
Linear programming
Langages formels
Entropy
Linear complexity
Information-theoretic cryptography
Finite-state dimension
Sturmian words
Property preserving morphisms
Error-correcting codes
Halting problem
Combinatorics on words
Tilings
Mutual information
Algorithmique du texte
Formal languages
Aperiodic tilings
Universalité
Automates cellulaires
Algorithmic randomness
Entropy region
Biclique cover
Generalizations of Sturmian words
Classical gas theory
Repetitions
Quasiperiodicity
Cellular automata
Algorithms
Kolmogorov structure function
Proof complexity
Coding theory
Palindromic length
Random bits
Normal sequences
S-adic conjecture
Bilinear systems
Computability
Cellular automata computation model generalization
Combinatorics on Words
Shannon entropy
Kolmogorov complexity
Kolmorogov complexity
Sofic shifts
Two dimension words
Corpuscular concepts
Kolmogorov Complexity
Algorithmic information theory
Pavages
Bilinear maps
Palindromes
Busy beavers
Information Theory
Semiconductor lasers
Secret sharing
Block complexity
Analytical models
Cellular automaton
Subword complexity
Automata
Birkhoff's ergodic theorem
Expanders
2D
S-adicity
Infinite words
Aperiodicity
Clusters
Symmetries
Ammann tilings
Algorithm
Quasiperiodic
Morphisms
Canonical single-corpuscle thermodynamics
Algorithmic statistics
Symbolic dynamics
Algorithmic learning theory
Generic algorithms
Calculabilité
Non-Shannon-type information inequalities
Real time
Factorization
Tseitin formulas
Factor complexity
Atmospheric modeling
Secret key agreement
Logic
Arithmetical hierarchy
Algorithmic complexity
Copy lemma
Expander mixing lemma
Morphism
Uniform recurrence
Nanolaser
Information inequalities
OBDD