CONTEXT-FREE GROUPS AND THEIR STRUCTURE TREES
DOI10.1142/S0218196713500124zbMath1270.20030arXiv1202.3276OpenAlexW3105724495MaRDI QIDQ4923204
Publication date: 5 June 2013
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1202.3276
Cayley graphscombinatorial group theorygroup actions on treesstructure treescontext-free groupsaccessible graphslocally finite graphs of finite tree width
Trees (05C05) Geometric group theory (20F65) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Groups acting on trees (20E08)
Related Items (10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Groups, graphs, languages, automata, games and second-order monadic logic
- Logical aspects of Cayley-graphs: the group case
- Graph minors. XX: Wagner's conjecture
- Groups, the theory of ends, and context-free languages
- Graphs and groups with tree-like properties
- The accessibility of finitely presented groups
- The theory of ends, pushdown automata, and second-order logic
- Actions of finite groups of graphs and related automorphisms of free groups
- Groups, trees and projective modules
- Vertex-transitive graphs and accessibility
- Cutting up graphs
- A characterisation of virtually free groups.
- On groups acting on locally finite graphs
- On torsion-free groups with infinitely many ends
- On Cayley graphs of virtually free groups
- Cutting up graphs revisited – a short proof of Stallings' structure theorem
- Hotz-isomorphism theorems in formal language theory
- Accessibility and Groups of Cohomological Dimension One
- Finite and infinite cyclic extensions of free groups
- A REMARK ABOUT COMBINGS OF GROUPS
- The co-word problem for the Higman-Thompson group is context-free
- GROUPS WITH CONTEXT-FREE CO-WORD PROBLEM
This page was built for publication: CONTEXT-FREE GROUPS AND THEIR STRUCTURE TREES