Word Problems Solvable in Logspace

  title={Word Problems Solvable in Logspace},
  author={Richard J. Lipton and Yechezkel Zalcstein},
  journal={J. ACM},
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 

From This Paper

Topics from this paper.

Similar Papers

Loading similar papers…