Thompson's group F is 1-counter graph automatic-Reference-Cited by-同舟云学术

Thompson's group F is 1-counter graph automatic

Published:2016-01-01 Issue:1 Volume:8 Page:
ISSN:1867-1144
Container-title:Groups Complexity Cryptology
language:
Short-container-title:

Author:

Elder Murray,Taback Jennifer

Abstract

AbstractIt is not known whether Thompson's group

Funder

Australian Research Council

National Science Foundation

Simons Foundation

Publisher

Walter de Gruyter GmbH

Subject

Applied Mathematics,Computational Mathematics,Computational Theory and Mathematics,Computer Networks and Communications

Link

https://www.degruyter.com/view/j/gcc.2016.8.issue-1/gcc-2016-0001/gcc-2016-0001.pdf

Reference13 articles.

1. The Dehn function and a regular set of normal forms for s groupF The Dehn function and a regular set of normal forms for s groupFJ;Guba;Math Soc Math Soc,1997

2. A context - free and a - counter geodesic language for a Baumslag Solitar group A context - free and a - counter geodesic language for a Baumslag Solitar groupTheoret;Elder;Comput Sci Comput Sci,2005

3. Seesaw words in Thompson s groupF Geometric Methods in Group Theory American Mathematical Society Providence Seesaw words in Thompson s groupFGeometric Methods in Group TheoryContemp American Mathematical SocietyProvidence;Cleary;Math Math,2005

4. Tame combing and almost convexity conditions Tame combing and almost convexity conditionsMath;Cleary;Math Z,2011

5. graph automatic groups graph automatic groupsJ;Elder;Algebra Algebra,2014

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. CAYLEY LINEAR-TIME COMPUTABLE GROUPS;GROUPS COMPLEX CRYPT;2023

2. Cayley polynomial–time computable groups;Information and Computation;2021-05

3. Autostackability of Thompson's group F;Journal of Algebra;2020-03

4. Higher rank lamplighter groups are graph automatic;Journal of Algebra;2018-02