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
Expander mixing lemma
Factorization
Corpuscular concepts
Shannon entropy
Random bits
Automates cellulaires
Symbolic dynamics
Analytical models
Real time
Almost entropic points
Ideal gas law
Generalizations of Sturmian words
Cellular automata
Communication complexity
Entropy
Complexité de Kolmogorov
Semiconductor lasers
Logic
Entropy region
Palindromic length
Algorithmic statistics
Tseitin formulas
Universalité
Quasiperiodic
Error-correcting codes
Uniform recurrence
Copy lemma
Secret key agreement
Subword complexity
Kolmogorov complexity
Tilings
Morphism
Bilinear maps
Proof complexity
Halting problem
Algorithms
Property preserving morphisms
Mutual information
Quasiperiodicity
Secret sharing
OBDD
Birkhoff's ergodic theorem
Algorithmique du texte
Two dimension words
Minimal SFT
Formal languages
Algorithmic information theory
Kolmorogov complexity
2D
Normal sequences
Kolmogorov structure function
Combinatorics on words
Algorithmic complexity
Algorithmic learning theory
Symmetries
Biclique cover
Cellular automaton
Coding theory
Sofic shifts
Algorithmic randomness
Canonical single-corpuscle thermodynamics
Aperiodicity
S-adicity
Carnot principle
Arithmetical hierarchy
Automata
Biological system modeling
Non-Shannon-type information inequalities
Information inequalities
Clusters
Linear complexity
Block complexity
Linear programming
Aperiodic tilings
S-adic conjecture
Information Theory
Repetitions
Sturmian words
Ammann tilings
Expanders
Cellular automata computation model generalization
Kolmogorov Complexity
Morphisms
Langages formels
Factor complexity
Nanolaser
Infinite words
Algorithm
Combinatorics on Words
Pavages
Classical gas theory
Information-theoretic cryptography
Atmospheric modeling
Calculabilité
Computability
Bilinear systems
Finite-state dimension
Palindromes
Generic algorithms
Busy beavers