Experimental Mathematics

Drawing limit sets of Kleinian groups using finite state automata

Greg McShane, John R. Parker, and Ian Redfern

Full-text: Open access

Abstract

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.

Article information

Source
Experiment. Math., Volume 3, Issue 2 (1994), 153-170.

Dates
First available in Project Euclid: 3 September 2003

Permanent link to this document
https://projecteuclid.org/euclid.em/1062620909

Mathematical Reviews number (MathSciNet)
MR1313880

Zentralblatt MATH identifier
0831.30027

Subjects
Primary: 30F40: Kleinian groups [See also 20H10]
Secondary: 68Q70: Algebraic theory of languages and automata [See also 18B20, 20M35]

Citation

McShane, Greg; Parker, John R.; Redfern, Ian. Drawing limit sets of Kleinian groups using finite state automata. Experiment. Math. 3 (1994), no. 2, 153--170. https://projecteuclid.org/euclid.em/1062620909


Export citation