Tree-based language complexity of Thompson's group \(F\).

DOI10.1515/GCC-2015-0009zbMath1335.20044arXiv1501.04315OpenAlexW2962859996MaRDI QIDQ889983

Jennifer Taback, Sharif Younes

Publication date: 9 November 2015

Published in: Groups, Complexity, Cryptology (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1501.04315

zbMATH Keywords

\(\mathcal C\)-graph automatic groupsgraph automatic groupsThompson group \(F\)

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Geometric group theory (20F65) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (2)

Thompson's group \(F\) is 1-counter graph automatic. ⋮ Higher rank lamplighter groups are graph automatic

This page was built for publication: Tree-based language complexity of Thompson's group \(F\).