The research carried out at the Automata and applications team covers the fundamental aspects of automata theory, as well as algorithmic questions arising from concrete problems. The fundamental aspects concern mainly semigroups, combinatorics on words, foundation of databases, the link with logic, topology, games, etc. In the recent years, special effort has been devoted to the extensions of the notion of automaton : automata on infinite or even transfinite words, automata with output, etc. Concerning applications, the team is working on problems arising from model checking, discrete event systems modelling, databases, computer arithmetic, and on algorithms for the automatic recognition in genetic sequences.

Automata seminar