Thompson's group \(F\) is 1-counter graph automatic. (Q285894): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2964148829 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1501.04313 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Automatic Transitive Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An infinite-dimensional torsion-free \(\text{FP}_{\infty}\) group / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-isometrically embedded subgroups of Thompson's group \(F\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introductory notes on Richard Thompson's groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tame combing and almost convexity conditions. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5692656 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A context-free and a 1-counter geodesic language for a Baumslag-Solitar group / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\mathcal C\)-graph automatic groups. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003861 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks on blind and partially blind one-way multicounter machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4351803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: From automatic structures to automatic groups. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thompson’s Group and Public Key Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-based language complexity of Thompson's group \(F\). / rank
 
Normal rank

Latest revision as of 01:13, 12 July 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
    0 references
    0 references
    0 references
    19 May 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Thompson group \(F\)
    0 references
    graph automatic groups
    0 references
    \(\mathcal C\)-graph automatic groups
    0 references
    0 references
    0 references