Abstract
Extending a result of Rabin, It Is shown that the word problem for hnear groups (groups of matrices) over a field of characteristic 0 is solvable in (deterministic) logspace As an apphcatlon of this result, it follows that the word problem for free groups and hence the membership problem for the two-sided Dyck language are solvable in logspace. © 1977, ACM. All rights reserved.
Author supplied keywords
Cite
CITATION STYLE
APA
Lipton, R. J., & Zalcstein, Y. (1977). Word Problems Solvable in Logspace. Journal of the ACM (JACM), 24(3), 522–526. https://doi.org/10.1145/322017.322031
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free