Bryan Mosher
Roughly speaking, a group is automatic if its Cayley graph can be described by recursively gluing together copies of a finite subgraph about the identity. This talk will give an introduction to finite state automata and automatic groups, with an emphasis on geometric applications, and a discussion of one particular application in the theory of hyperbolic 3-manifolds -- an application that may serve as a case study in the evolution of a dissertation topic.
Go Back to Junior Coll. Web page
URL http://www.math.umn.edu/jrcoll/ The University of Minnesota is an equal opportunity educator and employer. © 2004, The Regents of the University of Minnesota |
|