- Title
- Thompson's group F is 1-counter graph automatic
- Creator
- Elder, Murray; Taback, Jennifer
- Relation
- ARC.FT110100178
- Relation
- Groups Complexity Cryptology Vol. 8, Issue 1, p. 21-33
- Publisher Link
- http://dx.doi.org/10.1515/gcc-2016-0001
- Publisher
- Walter de Gruyter GmbH
- Resource Type
- journal article
- Date
- 2016
- Description
- 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 -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.
- Subject
- Thompson’s group <i>F</i>; automatic group; graph automatic group; C-graph automatic group
- Identifier
- http://hdl.handle.net/1959.13/1323341
- Identifier
- uon:24783
- Identifier
- ISSN:1869-6104
- Language
- eng
- Reviewed
- Hits: 1388
- Visitors: 1361
- Downloads: 0
Thumbnail | File | Description | Size | Format |
---|