Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Tree-based language complexity of Thompson's group F

Tree-based language complexity of Thompson's group F Abstract The definition of graph automatic groups by Kharlampovich, Khoussainov and Miasnikov and its extension to 𝒞-graph automatic by Elder and the first author raise the question of whether Thompson's group F is graph automatic. We define a language of normal forms based on the combinatorial “caret types”, which arise when elements of F are considered as pairs of finite rooted binary trees. The language is accepted by a finite state machine with two counters, and forms the basis of a 3-counter graph automatic structure for the group. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Groups Complexity Cryptology de Gruyter

Tree-based language complexity of Thompson's group F

Loading next page...
 
/lp/de-gruyter/tree-based-language-complexity-of-thompson-s-group-f-8fV3CTaH3y
Publisher
de Gruyter
Copyright
Copyright © 2015 by the
ISSN
1867-1144
eISSN
1869-6104
DOI
10.1515/gcc-2015-0009
Publisher site
See Article on Publisher Site

Abstract

Abstract The definition of graph automatic groups by Kharlampovich, Khoussainov and Miasnikov and its extension to 𝒞-graph automatic by Elder and the first author raise the question of whether Thompson's group F is graph automatic. We define a language of normal forms based on the combinatorial “caret types”, which arise when elements of F are considered as pairs of finite rooted binary trees. The language is accepted by a finite state machine with two counters, and forms the basis of a 3-counter graph automatic structure for the group.

Journal

Groups Complexity Cryptologyde Gruyter

Published: Nov 1, 2015

There are no references for this article.