Thompson's group \(F\) is 1-counter graph automatic.

DOI10.1515/GCC-2016-0001zbMath1344.20043arXiv1501.04313OpenAlexW2964148829MaRDI QIDQ285894

Jennifer Taback, Murray J. Elder

Publication date: 19 May 2016

Published in: Groups, Complexity, Cryptology (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1501.04313

zbMATH Keywords

\(\mathcal C\)-graph automatic groupsgraph automatic groupsThompson group \(F\)

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Generators, relations, and presentations of groups (20F05) Geometric group theory (20F65) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (3)

Higher rank lamplighter groups are graph automatic ⋮ Autostackability of Thompson's group \(F\) ⋮ Cayley polynomial-time computable groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(\mathcal C\)-graph automatic groups.
• A context-free and a 1-counter geodesic language for a Baumslag-Solitar group
• Tame combing and almost convexity conditions.
• An infinite-dimensional torsion-free \(\text{FP}_{\infty}\) group
• Tree-based language complexity of Thompson's group \(F\).
• Remarks on blind and partially blind one-way multicounter machines
• Quasi-isometrically embedded subgroups of Thompson's group \(F\)
• Introductory notes on Richard Thompson's groups
• From automatic structures to automatic groups.
• On Automatic Transitive Graphs
• Thompson’s Group and Public Key Cryptography

This page was built for publication: Thompson's group \(F\) is 1-counter graph automatic.