Carte non disponible
Speaker Home page :
Speaker :
Speaker Affiliation :


Date(s) - 28/11/2014
11 h 00 min - 12 h 00 min

Catégories Pas de Catégories

In this talk I will give a gentle introduction to graphs and groups
associated with the action of an automaton (transducer) on the set of
words on a finite alphabet. I will show very interesting connections
with Probability, Complex Dynamics, and Computer Science, focusing my
attention on a series of open problems that naturally appear in this
context. In particular I want to discuss how a
probabilistic/combinatorial approach might be useful in order to attack
the problem of the freeness of automata groups.

Retour en haut 

Secured By miniOrange