Evènement pour le groupe Séminaire Méthodes Formelles

Date 2020-03-17  14:00-15:00
TitreFinite automata presentable groups 
Résumé A mathematical structure M is called finite automata presentable if the elements of M can be represented by strings in a regular language, in such a way that the relations and functions of M are also decided by finite automata. We will discuss the extent of this notions in. the context of groups. Older work with Thomas shows that every finitely generated subgroup is abelian by finite. Recent work with Stephan gives new examples and counterexamples in the setting of groups that are nilpotent of class 2. We will also discuss the possibility of a complete description of such groups. 
OrateurAndré Nies 
UrlUniversity of Auckland  

Aucun document lié à cet événement.

Retour à l'index