Autostackability of Thompson's group F

Nathan Corwin, Gili Golan, Susan Hermiller, Ashley Johnson, Zoran Šunić

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Pages (from-to)111-134
Number of pages24
JournalJournal of Algebra
StatePublished - 1 Mar 2020


  • Automatic group
  • Autostackable
  • Finite state automata
  • Rewriting system
  • Thompson's group
  • Word problem

All Science Journal Classification (ASJC) codes

  • Algebra and Number Theory


Dive into the research topics of 'Autostackability of Thompson's group F'. Together they form a unique fingerprint.

Cite this