A fast algorithm for Stallings foldings over virtually free groups
DOI10.1142/S0218196724500498MaRDI QIDQ6660948
Samuel Cookson, Nicholas W. M. Touikan
Publication date: 10 January 2025
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Geometric group theory (20F65) Free products of groups, free products with amalgamation, Higman-Neumann-Neumann extensions, and generalizations (20E06) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Groups, the theory of ends, and context-free languages
- Finite automata for Schreier graphs of virtually free groups
- Topology of finite graphs
- Combinatorial group theory.
- Stallings foldings and subgroups of free groups
- Stallings graphs for quasi-convex subgroups
- Introduction to group theory. Translated from the Russian. With a new chapter.
- A FAST ALGORITHM FOR STALLINGS' FOLDING PROCESS
- STALLINGS FOLDINGS AND SUBGROUPS OF AMALGAMS OF FINITE GROUPS
- Finite and infinite cyclic extensions of free groups
- Efficiency of a Good But Not Linear Set Union Algorithm
- FOLDINGS, GRAPHS OF GROUPS AND THE MEMBERSHIP PROBLEM
This page was built for publication: A fast algorithm for Stallings foldings over virtually free groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6660948)
