Abstract
The word problem is tractable on a real-time Turing machine for every finitely presented commutative semigroup.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Garey M. R. and Johnson D. S., Computers and Intractibility. A Guide to the Theory of NP-Completeness, W. H. Freeman and Co., San Francisco (1979).
Kharlampovich O. G. and Sapir M. V., “Algorithmic problems in varieties,” Internat. J. Algebra Comput., 5, No. 4–5, 379-602 (1995).
Sapir M. V., “Algorithmic problems in varieties of semigroups,” Izv. Vyssh. Uchebn. Zaved. Matematika, No. 12, 71-74 (1985).
Sapir M. V., “Algorithmic problems in varieties of semigroups,” Algebra i Logika, 27, No. 4, 440-463 (1988).
Emelichev V. A., “Commutative semigroups with one defining relation,” Shuisk Gos. Ped. Inst. Uchen. Zap., 6, 227-242 (1958).
Mal'tsev A. I., “On homomorphisms on finite groups,” Ivanovo Gos. Ped. Inst. Uchen. Zap., 18, 49-60 (1958).
Taitslin M. A., “On elementary theories of commutative semigroups with reduction,” Algebra i Logika, 5, No. 1, 51-69 (1966).
Taitslin M. A., “On elementary theories of commutative semigroups,” Algebra i Logika, 5, No. 4, 55-89 (1966).
Cardoza E. W., Computational Complexity of the Word Problem for Commutative Semigroups, MAC Technical Memorandum 67, MIT (1975).
Mayr E. W. and Meyer A. R., “The complexity of the word problem for commutative semigroups and polynomial ideals,” Adv. Math., 46, No. 3, 305-329 (1982).
Alonso J. M., Brady T., Cooper D., Ferlini V., Lustig M., Mihalik M., Shapiro M., and Short H., “Notes on word hyperbolic groups,” in: Eds. E. Ghys, A. Haefliger and A. Verjovsky, Group Theory from a Geometrical Viewpoint, Proceedings of a Workshop, Held at the International Centre for Theoretical Physics in Trieste, Italy, 26 March to 6 April 1990, World Scientific, Singapore, 1991, pp. 3-63.
Holt D. F., “Word-hyperbolic groups have real-time word problem,” Internat. J. Algebra Comput., 10, No. 2, 221-227 (2000).
Rabin M. O., “Real time computation,” Israel J. Math., 1, 203-211 (1963).
Rosenberg A., “Real-time definable languages,” J. Assoc. Comput. Mach., 14, 645-662 (1967).
Taitslin M. A., “On algorithmic problems for commutative semigroups,” Dokl. Akad. Nauk SSSR, No. 9, 201-204 (1968).
Ginsburg S. and Spanier E. H., “Semigroups, Presburger formulas, and languages,” Pacific J. Math., 16, No. 2, 285-296 (1965).
Lisovik L. P., “Semilinear sets and solvable problems,” Mat. Probl. Kibern., No. 1, 201-222 (1988).
Mal'tsev A. I., Algorithms and Recursive Functions [in Russian], Nauka, Moscow (1965).
Gurevich Yu. Sh., “The word problem for certain classes of semigroups,” Algebra i Logika, 5, No. 5, 25-35 (1966).
Murskii V. L., “Some examples of varieties of semigroups,” Mat. Zametki, 3, No. 6, 663-670 (1968).
Popov V. Yu., “On the equational theories of classes of finite semigroups,” Algebra i Logika, 40, No. 1, 97-116 (2001).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Popov, V.Y. On Complexity of the Word Problem for Finitely Presented Commutative Semigroups. Siberian Mathematical Journal 43, 1086–1093 (2002). https://doi.org/10.1023/A:1021125502991
Issue Date:
DOI: https://doi.org/10.1023/A:1021125502991