On some groups generated by finite automata
Time and place
12:20 PM on Thursday, November 17th, 2016; NAC 6/113
Rachel Skipper (Binghamton University)
Abstract
Every invertible finite state automaton produces a group of automorphisms of a regular rooted tree. In this talk, we outline how to obtain a group from an automaton and then discuss a particular family of examples.