BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Klaus Sutner (Carnegie Mellon University)
DTSTART:20260325T140000Z
DTEND:20260325T150000Z
DTSTAMP:20260423T021231Z
UID:FLAT/18
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/FLAT/18/">Th
 e structure of Abelian automata</a>\nby Klaus Sutner (Carnegie Mellon Univ
 ersity) as part of One FLAT World Seminar\n\n\nAbstract\nWe study invertib
 le Mealy automata acting on finite binary words\, viewed as automorphisms 
 of the rooted infinite binary tree. We give a detailed structural characte
 rization of the automata whose associated automaton groups are free Abelia
 n\, and use Groebner bases to determine the linear “residuation matrix
 ” that encodes the recursive action of these automorphisms on subtrees.\
 n\nThere are several natural decision problems associated with the orbits 
 of the automorphisms defined by these automata\, such as orbit membership 
 and the computation of “time stamps” (the first time a configuration a
 ppears along an orbit). We present some partial results concerning the com
 putational complexity of these problems. Finally\, we explore connections 
 with canonical normal forms in the associated numeration systems\, in the 
 spirit of Knuth’s work from the 1960s.\n\nThis is joint work with Tim Be
 cker and Chris Grossack.\n
LOCATION:https://researchseminars.org/talk/FLAT/18/
END:VEVENT
END:VCALENDAR