Abstract
In this paper, we show that the Generalized Word Problem for finitely-generated subgroups of Countably-generated free groups with generators of length 2, GWPC(2), is complete for NSYMLOG via logspace reductions. We use Immerman's logical characterization of NSYMLOG as (FO+posSTC).
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
