Word problems for 2-Homogeneous monoids and symmetric logspace

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2136, Issue , 2001, Pages 500-512

  Lohrey, Markus ^a  

^a UNIVERSITY OF STUTTGART   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

FREE GROUPS; LOG SPACE; MONOIDS; SEMI-THUE SYSTEM; WORD PROBLEM;

ALGEBRA;

EID: 84974695725     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44683-4_44     Document Type: Conference Paper

References (27)

1. S. I. Adjan. Defining relations and algorithmic problems for groups and semigroups, volume 85 of Proceedings of the Steklov Institute of Mathematics. AmericanMathematical Society, 1967.
2. C. Alvarez and R. Greenlaw. A compendium of problems complete for symmetric logarithmic space. Electronic Colloquium on Computational Complexity, Report No. TR96-039, 1996.
3. 4/3) space algorithm for (s, t) connectivity in undirected graphs. Journal of the Association for Computing Machinery, 47(2):294-311, 2000.
4. 1. Information Processing Letters, 32:251-256, 1989.
5. 1. Journal of Computer and System Sciences, 41:274-306, 1990.
6. R. Book and F. Otto. String-Rewriting Systems. Springer, 1993.
7. R. V. Book. Confluent and other types of Thue systems. Journal of the Association for Computing Machinery, 29(1):171-182, 1982.
8. R. V. Book. Homogeneous Thue systems and the Church-Rosser property. Discrete Mathematics, 48:137-145, 1984.
9. R. V. Book, M. Jantzen, B. Monien, C. P. O’Dunlaing, and C. Wrathall. On the complexity of word problems in certain Thue systems. In J. Gruska and M. Chytil, editors, Proceedings of the 10rd Mathematical Foundations of Computer Science (MFCS’81), Štrbské Pleso (Czechoslovakia), number 118 in Lecture Notes in Computer Science, pages 216-223. Springer, 1981.
10. S. R. Buss. The Boolean formula value problem is in ALOGTIME. In Proceedings of the 19th Annual Symposium on Theory of Computing (STOC 87), pages 123-131. ACM Press, 1987.
11. S. A. Cook. A taxonomy of problems with fast parallel algorithms. Information and Control, 64:2-22, 1985.
12. N. Immerman. Languages that capture complexity classes. SIAM Journal on Computing, 16(4):760-778, 1987.
13. M. Jantzen. Confluent string rewriting. In EATCS Monographs on theoretical computer science, volume 14. Springer, 1988.
14. H. R. Lewis and C. H. Papadimitriou. Symmetric space-bounded computation. Theoretical Computer Science, 19(2):161-187, 1982.
15. R. J. Lipton and Y. Zalcstein. Word problems solvable in logspace. Journal of the Association for Computing Machinery, 24(3):522-526, 1977.
16. M. Lohrey. Word problems and confluence problems for restricted semi-Thue systems. In L. Bachmair, editor, Proceedings of the 11th International Conference on Rewrite Techniques and Applications (RTA 2000), Norwich (UK), number 1833 in Lecture Notes in Computer Science, pages 172-186. Springer, 2000.
17. R. C. Lyndon and P. E. Schupp. Combinatorial Group Theory. Springer, 1977..
18. A. Markov. On the impossibility of certain algorithms in the theory of associative systems. Doklady Akademii Nauk SSSR, 55, 58:587-590, 353-356, 1947.
19. N. Nisan and A. Ta-Shma. Symmetric logspace is closed under complement. Chicago Journal of Theoretical Computer Science, 1995.
20. F. Otto and L. Zhang. Decision problems for finite special string-rewriting systems that are confluent on some congruence class. Acta Informatica, 28:477-510, 1991.
21. C. H. Papadimitriou. Computational Complexity. Addison Wesley, 1994.
22. E. Post. Recursive unsolvability of a problem of Thue. Journal of Symbolic Logic, 12(1):1-11, 1947.
23. D. Robinson. Parallel Algorithms for Group Word Problems. PhD thesis, University of California, San Diego, 1993.
24. W. L. Ruzzo. On uniform circuit complexity. Journal of Computer and System Sciences, 22:365-383, 1981.
25. I. Stewart. Complete problems for symmetric logspace involving free groups. Information Processing Letters, 40:263-267, 1991.
26. I. Stewart. Refining known results on the generalized word problem for free groups. International Journal of Algebra and Computation, 2:221-236, 1992.
27. H. Vollmer. Introduction to Circuit Complexity. Springer, 1999.