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