Autostackability of Thompson's group F

2018/11/28 by Nathan Corwin, Gili Golan, Corwin, Nathan +7
Computer Science · Mathematics · #20F10 #20F65 #68Q42 #Algorithms and Data Compression #FOS: Computer and information sciences #FOS: Mathematics #Formal Languages and Automata Theory (cs.FL) #Geometric and Algebraic Topology #Group Theory (math.GR) #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.1811.11691

openalex publication_date 2018/11/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

The word problem for Thompson's group F has a solution, but it remains unknown whether F is automatic or has a finite or regular convergent (terminating and confluent) rewriting system. We show that the group F admits a natural extension of these two properties, namely autostackability, and we give an explicit bounded regular convergent prefix-rewriting system for F.

Related

• The falsification by fellow traveler property implies geodesic autostackability
• Homology and closure properties of autostackable groups
• Algorithms and topology for Cayley graphs of groups
• Restrictions on Potential Automatic Structures on Thompson's Group F
• Thompson's group F is 1-counter graph automatic