Open Access
1994 Drawing limit sets of Kleinian groups using finite state automata
Greg McShane, John R. Parker, Ian Redfern
Experiment. Math. 3(2): 153-170 (1994).


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.


Download Citation

Greg McShane. John R. Parker. Ian Redfern. "Drawing limit sets of Kleinian groups using finite state automata." Experiment. Math. 3 (2) 153 - 170, 1994.


Published: 1994
First available in Project Euclid: 3 September 2003

zbMATH: 0831.30027
MathSciNet: MR1313880

Primary: 30F40
Secondary: 68Q70

Rights: Copyright © 1994 A K Peters, Ltd.

Vol.3 • No. 2 • 1994
Back to Top