Web site of the group in English: http://www.lirmm.fr/escape/
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.
- Tilings
- Cellular automata
- Turing machines
- Finite and inifinite words and morphisms
- Computability
- Complexity
- Combinatorics
- Logic
- Set theory
- Algorithmics
International :
- Leonid Levin et Peter Gacs – Boston University, USA
- Theodore Slaman – Univ. of California, Berkeley, USA
- Jarkko Kari – University of Turku, Finlande
- Nikolai Vereshchagin – Moscow University, Russia
- Menachem Magidor – Hebrew U. Jérusalem, Israël
- Katsunobu Imai – Hiroshima University, Japan
National :
- Emmanuel Jeandel – Loria, Nancy
- Nicolas Ollinger – LIFO, Orléans
- Enrico Formenti – I3S, Nice
- Laurent Bienvenu – LIAFA, Paris
- Gaëtan Richard – Greyc, Caen
The ESCAPE team hosts a common research seminar with the ECO team. Presentations are given either by invited external speakers or members of the hosting teams (roughly half each). It is currently organized by Bruno Grenet and Andrei Romashchenko.