Autostackability of Thompson's group F

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

doi:https://doi.org/10.1016/j.jalgebra.2019.04.004

Autostackability of Thompson's group F

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

Department of Mathematics

Ben-Gurion University of the Negev

Research output: Contribution to journal › Article › peer-review

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.

Original language	American English
Pages (from-to)	111-134
Number of pages	24
Journal	Journal of Algebra
Volume	545
DOIs	https://doi.org/10.1016/j.jalgebra.2019.04.004
State	Published - 1 Mar 2020

Keywords

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

All Science Journal Classification (ASJC) codes

Algebra and Number Theory

Access to Document

https://doi.org/10.1016/j.jalgebra.2019.04.004

Cite this

@article{17106228bbcd4b79b52049f37a03f90f,

title = "Autostackability of Thompson's group F",

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.",

keywords = "Automatic group, Autostackable, Finite state automata, Rewriting system, Thompson's group, Word problem",

author = "Nathan Corwin and Gili Golan and Susan Hermiller and Ashley Johnson and Zoran {\v S}uni{\'c}",

note = "Publisher Copyright: {\textcopyright} 2019 Elsevier Inc.",

year = "2020",

month = mar,

day = "1",

doi = "https://doi.org/10.1016/j.jalgebra.2019.04.004",

language = "American English",

volume = "545",

pages = "111--134",

journal = "Journal of Algebra",

issn = "0021-8693",

publisher = "Academic Press Inc.",

}

TY - JOUR

T1 - Autostackability of Thompson's group F

AU - Corwin, Nathan

AU - Golan, Gili

AU - Hermiller, Susan

AU - Johnson, Ashley

AU - Šunić, Zoran

PY - 2020/3/1

Y1 - 2020/3/1

N2 - 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.

AB - 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.

KW - Automatic group

KW - Autostackable

KW - Finite state automata

KW - Rewriting system

KW - Thompson's group

KW - Word problem

UR - http://www.scopus.com/inward/record.url?scp=85076585250&partnerID=8YFLogxK

U2 - https://doi.org/10.1016/j.jalgebra.2019.04.004

DO - https://doi.org/10.1016/j.jalgebra.2019.04.004

M3 - Article

SN - 0021-8693

VL - 545

SP - 111

EP - 134

JO - Journal of Algebra

JF - Journal of Algebra

ER -

Autostackability of Thompson's group F

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this