Date:	Tue, April 29, 2014
Time:	14:15
Place:	Research I Seminar Room

Abstract: First, I am going to discuss Nekrashevich's approach to computation of iterated monodromy groups (IMGs) of polynomials. Namely, Nekrashevych described a special class of automata, the kneading automata, such that the IMG of every post-critically finite polynomial is generated by an automaton in the class. There is no known class of such automata for the rational case. In my talk I will describe a combinatorial approach to computation of the iterated monodromy group of an expanding Thurston map.