Skip to main content
Log in

Complexity of the word problem for commutative semigroups of fixed dimension

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

In this paper we investigate the computational complexity of the word problem for commutative semigroups of fixed dimension. It is shown that for commutative semigroups of dimension k, k ≧ 6, the word problem is complete for symmetric linear space, providing another complete problem for this symmetric complexity class. We also show that in the case of one generator, the word problem is solvable in polynomial time.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Reference

  1. Cardoza, E., Lipton, R., Meyer, A.R.: Exponential Space Complete Problems for Petri Nets and Commutative Semigroups: Preliminary Report, Proc. 8th Ann. ACM Symposium on Theory of Computing, pp. 50–54, 1976

  2. Biryukov, A.P.: Some Algorithmic Problems for Finitely Defined Commutative Semigroups. Sib. Math. J. 8, 384–391 (1967)

    Google Scholar 

  3. Eilenberg, S., Schützenberger, M.P.: Rational Sets in Commutative Monoids. J. Algebra 13, 173–191 (1969)

    Google Scholar 

  4. Fisher, P.C., Meyer, A.R., Rosenberg, A.L.: Counter Machines and Counter Languages. Math. Syst. Theory 2, 265–283 (1968)

    Google Scholar 

  5. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Reading, MA: Addison-Wesley 1979

    Google Scholar 

  6. Huynh, D.T.: The Complexity of the Membership Problem for Two Subclasses of Polynomial Ideals. Manuscript, 1984 (To appear in SIAM J. Comput.)

  7. Huynh, D.T.: The Complexity of the Equivalence Problem for Commutative Semigroups and Symmetric Vector Addition Systems. Proc. 17th STOC, pp. 405–412, 1985

  8. Van Leeuwen, J.: A Partial Solution to the Reachability Problem for Vector Addition Systems. Proc. 6th Ann. ACM Symposium on Theory of Computing, pp. 303–307, 1974

  9. Lewis, H.R., Papadimitriou, C.H.: Symmetric Space-Bounded Computation. Theor. Comput. Sci. 19, 161–187 (1982)

    Google Scholar 

  10. Mayr, E., Meyer, A.R.: The Complexity of the Word Problems for Commutative Semigroups and Polynomial Ideals. Adv. Math. 45, 305–329 (1982)

    Google Scholar 

  11. Mayr, E.: An Algorithm for the General Petri Net Reachability Problem. Proc. 13th Ann. Symposium on Theory of Computing, pp. 238–246, 1981

  12. Taiclin, M.A.: Algorithmic Problem for Commutative Semigroups. Sov. Math. Dokl. 9, 201–204 (1968)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Huynh, D.T. Complexity of the word problem for commutative semigroups of fixed dimension. Acta Informatica 22, 421–432 (1985). https://doi.org/10.1007/BF00288776

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00288776

Keywords

Navigation