A FAST ALGORITHM FOR STALLINGS' FOLDING PROCESS
From MaRDI portal
Publication:3430309
DOI10.1142/S0218196706003396zbMath1111.20032arXiv0805.2348MaRDI QIDQ3430309
Publication date: 21 March 2007
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0805.2348
Subgroup theorems; subgroup growth (20E07) Generators, relations, and presentations of groups (20F05) Graph theory (including graph drawing) in computer science (68R10) Free nonabelian groups (20E05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Related Items (19)
Random van Kampen diagrams and algorithmic problems in groups ⋮ Non-commutative lattice problems ⋮ On the Generalized Membership Problem in Relatively Hyperbolic Groups ⋮ Stallings graphs for quasi-convex subgroups ⋮ State graphs and fibered state surfaces ⋮ ON THE COMPLEXITY OF THE WHITEHEAD MINIMIZATION PROBLEM ⋮ Generalized primitivity of labeled digraphs ⋮ On Substitutions Preserving Their Return Sets ⋮ On an algorithm to decide whether a free group is a free factor of another ⋮ RANDOM GENERATION OF FINITELY GENERATED SUBGROUPS OF A FREE GROUP ⋮ Generic properties of subgroups of free groups and finite presentations ⋮ READING OFF KUROSH DECOMPOSITIONS ⋮ Statistical properties of subgroups of free groups ⋮ A list of applications of Stallings automata ⋮ The monomorphism problem in free groups. ⋮ Unnamed Item ⋮ Conjugacy search problem and the Andrews-Curtis conjecture ⋮ DOUBLE COSETS IN FREE GROUPS ⋮ Search problems in groups and branching processes
Cites Work
This page was built for publication: A FAST ALGORITHM FOR STALLINGS' FOLDING PROCESS
