Thompson's group F is 1-counter graph automatic

Publication Type:
Journal Article
Groups, Complexity, Cryptology, 2016, 8 (1), pp. 21 - 33
Issue Date:
Full metadata record
Files in This Item:
Filename Description Size
out (2).pdfPublished Version660.29 kB
Adobe PDF
© 2016 by De Gruyter. It is not known whether Thompson's group F is automatic. With the recent extensions of the notion of an automatic group to graph automatic by Kharlampovich, Khoussainov and Miasnikov and then to C-graph automatic by the authors, a compelling question is whether F is graph automatic or C-graph automatic for an appropriate language class C. The extended definitions allow the use of a symbol alphabet for the normal form language, replacing the dependence on generating set. In this paper we construct a 1-counter graph automatic structure for F based on the standard infinite normal form for group elements.
Please use this identifier to cite or link to this item: