Embeddings into Thompson's group V and coCF groups
DOI10.1112/jlms/jdw044zbMath1406.20042DBLPjournals/jlms/BleakMN16arXiv1312.1855OpenAlexW2347013723WikidataQ57460864 ScholiaQ57460864MaRDI QIDQ2835337
Max Neunhöffer, Collin Bleak, Francesco Matucci
Publication date: 2 December 2016
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1312.1855
Formal languages and automata (68Q45) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Word problems, etc. in computability and recursion theory (03D40) Groups acting on trees (20E08)
Related Items (11)
Uses Software
Cites Work
- Unnamed Item
- Groups, the theory of ends, and context-free languages
- The accessibility of finitely presented groups
- The theory of ends, pushdown automata, and second-order logic
- Higher dimensional Thompson groups.
- Conjugacy and dynamics in Thompson's groups.
- Surface subgroups from linear programming
- Centralizers in the R. Thompson group \(V_n\).
- Free products in R. Thompson’s group 𝑉
- GROUPS WITH CONTEXT-FREE CONJUGACY PROBLEMS
- GROUPS WITH INDEXED CO-WORD PROBLEM
- THOMPSON'S GROUP V FROM A DYNAMICAL VIEWPOINT
- Diagram groups
- Groups of homeomorphisms of one-manifolds III: nilpotent subgroups
- The co-word problem for the Higman-Thompson group is context-free
- GROUPS AND SEMIGROUPS WITH A ONE-COUNTER WORD PROBLEM
- GROUPS WITH CONTEXT-FREE CO-WORD PROBLEM
- Random groups contain surface subgroups
This page was built for publication: Embeddings into Thompson's group V and coCF groups