Thompson's group \(F\) is 1-counter graph automatic. (Q285894): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1515/gcc-2016-0001 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1515/GCC-2016-0001 / rank | |||
Normal rank | |||
Revision as of 13:23, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Thompson's group \(F\) is 1-counter graph automatic. |
scientific article |
Statements
Thompson's group \(F\) is 1-counter graph automatic. (English)
0 references
19 May 2016
0 references
Thompson group \(F\)
0 references
graph automatic groups
0 references
\(\mathcal C\)-graph automatic groups
0 references
