Autostackability of Thompson's group $F$
Group Theory
2018-11-29 v1 Formal Languages and Automata Theory
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 .
Keywords
Cite
@article{arxiv.1811.11691,
title = {Autostackability of Thompson's group $F$},
author = {Nathan Corwin and Gili Golan and Susan Hermiller and Ashley Johnson and Zoran Sunic},
journal= {arXiv preprint arXiv:1811.11691},
year = {2018}
}
Comments
21 pages