Skip to main content
SpringerLink
Log in

Word Problems for 2-Homogeneous Monoids and Symmetric Logspace

  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 2001 (MFCS 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2136))

Abstract

We prove that the word problem for every monoid presented by a fixed 2-homogeneous semi-Thue system can be solved in log-space, which generalizes a result of Lipton and Zalcstein for free groups. The uniform word problem for the class of all 2-homogeneous semi-Thue systems is shown to be complete for symmetric log-space.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S.I. Adjan. Defining relations and algorithmic problems for groups and semigroups, volume 85 of Proceedings of the Steklov Institute of Mathematics. American Mathematical Society, 1967.

    Google Scholar 

  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.

    Google Scholar 

  3. R. Armoni, A. Ta-Shma, A. Widgerson, and S. Zhou. An O(log(n)4/3) space algorithm for (s, t) connectivity in undirected graphs. Journal of the Association for Computing Machinery, 47(2):294–311, 2000.

    MATH  Google Scholar 

  4. D. A. M. Barrington and J. Corbet. On the relative complexity of some languages in NC1. Information Processing Letters, 32:251–256, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  5. D. A. M. Barrington, N. Immerman, and H. Straubing. On uniformity within NC1. Journal of Computer and System Sciences, 41:274–306, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  6. R. Book and F. Otto. String-Rewriting Systems. Springer, 1993.

    Google Scholar 

  7. R. V. Book. Confluent and other types of Thue systems. Journal of the Association for Computing Machinery, 29(1):171–182, 1982.

    MATH  MathSciNet  Google Scholar 

  8. R. V. Book. Homogeneous Thue systems and the Church-Rosser property. Discrete Mathematics, 48:137–145, 1984.

    Article  MATH  MathSciNet  Google Scholar 

  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), Strbské Pleso (Czechoslovakia), number 118 in Lecture Notes in Computer Science, pages 216–223. Springer, 1981.

    Google Scholar 

  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.

    Google Scholar 

  11. S. A. Cook. A taxonomy of problems with fast parallel algorithms. Information and Control, 64:2–22, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  12. N. Immerman. Languages that capture complexity classes. SIAM Journal on Computing, 16(4):760–778, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  13. M. Jantzen. Confluent string rewriting. In EATCS Monographs on theoretical computer science, volume 14. Springer, 1988.

    Google Scholar 

  14. H. R. Lewis and C. H. Papadimitriou. Symmetric space-bounded computation. Theoretical Computer Science, 19(2):161–187, 1982.

    Article  MATH  MathSciNet  Google Scholar 

  15. R. J. Lipton and Y. Zalcstein. Word problems solvable in logspace. Journal of the Association for Computing Machinery, 24(3):522–526, 1977.

    MATH  MathSciNet  Google Scholar 

  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.

    Google Scholar 

  17. R. C. Lyndon and P. E. Schupp. Combinatorial Group Theory. Springer, 1977.

    Google Scholar 

  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.

    Google Scholar 

  19. N. Nisan and A. Ta-Shma. Symmetric logspace is closed under complement. Chicago Journal of Theoretical Computer Science, 1995.

    Google Scholar 

  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.

    Article  MATH  MathSciNet  Google Scholar 

  21. C. H. Papadimitriou. Computational Complexity. Addison Wesley, 1994.

    Google Scholar 

  22. E. Post. Recursive unsolvability of a problem of Thue. Journal of Symbolic Logic, 12(1):1–11, 1947.

    Article  MathSciNet  Google Scholar 

  23. D. Robinson. Parallel Algorithms for Group Word Problems. PhD thesis, University of California, San Diego, 1993.

    Google Scholar 

  24. W. L. Ruzzo. On uniform circuit complexity. Journal of Computer and System Sciences, 22:365–383, 1981.

    Article  MATH  MathSciNet  Google Scholar 

  25. I. Stewart. Complete problems for symmetric logspace involving free groups. Information Processing Letters, 40:263–267, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  26. I. Stewart. Refining known results on the generalized word problem for free groups. International Journal of Algebra and Computation, 2:221–236, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  27. H. Vollmer. Introduction to Circuit Complexity. Springer, 1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität Stuttgart, Breitwiesenstr. 20-22, 70565, Stuttgart, Germany

    Markus Lohrey

Authors
  1. Markus Lohrey
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Mathematical Institute, AS CR, Žitná 25, 115 67, Praha 1, Czech Republic

    Jiří Sgall

  2. Faculty of Mathematics and Physics Institute for Theoretical Computer Science (ITI), Charles University, Malostranské náměstí 25, 118 00, Praha 1, Czech Republic

    Aleš Pultr  & Petr Kolman  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lohrey, M. (2001). Word Problems for 2-Homogeneous Monoids and Symmetric Logspace. In: Sgall, J., Pultr, A., Kolman, P. (eds) Mathematical Foundations of Computer Science 2001. MFCS 2001. Lecture Notes in Computer Science, vol 2136. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44683-4_44

Download citation

  • DOI: https://doi.org/10.1007/3-540-44683-4_44

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42496-3

  • Online ISBN: 978-3-540-44683-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation