Drawing limit sets of Kleinian groups using finite state automata
McShane, Greg ; Parker, John R. ; Redfern, Ian
Experiment. Math., Tome 3 (1994) no. 4, p. 153-170 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
The theory of automatic groups (groups that can be treated by means of finite-state automata), and in particular the techniques of automatic coset enumeration developed by Redfern, are applied to the problem of computing limit sets of a large class of Kleinian groups. We discuss in detail the case of groups in the Maskit embedding of the \tspace/ of the punctured torus.
Publié le : 1994-05-14
Classification:  30F40,  68Q70 
@article{1062620909,
     author = {McShane, Greg and Parker, John R. and Redfern, Ian},
     title = {Drawing limit sets of Kleinian groups using finite state automata},
     journal = {Experiment. Math.},
     volume = {3},
     number = {4},
     year = {1994},
     pages = { 153-170},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1062620909}
}

McShane, Greg; Parker, John R.; Redfern, Ian. Drawing limit sets of Kleinian groups using finite state automata. Experiment. Math., Tome 3 (1994) no. 4, pp.  153-170. http://gdmltest.u-ga.fr/item/1062620909/