00:00:00 / 00:00:00

Appears in collection : GAGTA, Geometric and Asymptotic Group Theory with Applications / Théorie des Groupes Géométrique et Asymptotique - Week 2

I will present a general notion of automatic action, based on Büchi automata, and show how it unifies a large number of subclasses, in particular the automatic groups by Cannon, Thurston et al., the transducer groups by Aleshin, Grigorchuk, Sushchansky, Sidki et al., and substitutional subshifts. I will present some algorithms for these groups, and in particular show under an extra condition (boundedness) that their orbit relation is computable. This will have strong decidability consequences, such as that the order problem, aperiodicity, minimality, etc. for automatic transformations is decidable.

Information about the video

Citation data

Last related questions on MathOverflow

You have to connect your Carmin.tv account with mathoverflow to add question

Ask a question on MathOverflow


  • Bookmark videos
  • Add videos to see later &
    keep your browsing history
  • Comment with the scientific
  • Get notification updates
    for your favorite subjects
Give feedback