Keyword: Stallings' Folding : Search

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

Advanced Search

SEARCH GUIDE

Results: 1 - 1of1

Follow results:

per page:

Sort: Relevance

Context for search term 1Search term 1*

All Dates

LastSelect static range

Custom Range

Select starting monthSelect starting year

Select ending monthSelect ending year

Search name	Searched On	Run search
Keyword: Stallings' Folding (1)	2 Apr 2025	Run
Keyword: Wakefield Generation (1)	2 Apr 2025	Run
Keyword: Force-distance Curve (2)	2 Apr 2025	Run
Keyword: Molecular Biophysics (1)	2 Apr 2025	Run
Keyword: Head Pose Estimation (6)	2 Apr 2025	Run

articleNo Access
A FAST ALGORITHM FOR STALLINGS' FOLDING PROCESS
- NICHOLAS W. M. TOUIKAN
International Journal of Algebra and Computation01 Dec 2006
Preview Abstract
Stalling's folding process is a key algorithm for solving algorithmic problems for finitely generated subgroups of free groups. Given a subgroup H = 〈J₁,…,J_m〉 of a finitely generated nonabelian free group F = F(x₁,…,x_n) the folding porcess enables one, for example, to solve the membership problem or compute the index [F : H]. We show that for a fixed free group F and an arbitrary finitely generated subgroup H (as given above) we can perform the Stallings' folding process in time O(N log*(N)), where N is the sum of the word lengths of the given generators of H.

1