Optimal Algorithms for the Coverability, the Subword, the Containment, and the Equivalence Problems for Commutative Semigroups

Author： Koppenhagen U.   Mayr E.W.  

Publisher： Academic Press

ISSN： 0890-5401

Source： Information and Computation, Vol.158, Iss.2, 2000-05, pp. : 98-124

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

On RDGCn-commutative permutable semigroups

By Jiang Zhonghao   Chen Limin  

Periodica Mathematica Hungarica, Vol. 49, Iss. 2, 2004-12 ,pp. : 91-98

Springer Publishing Company

Access to resources Recommend Favorite

Commutative semigroups and a generalization of the concept of mean

By Biasi C.   Zuffi E.M.  

International Journal of Mathematical Education in Science and Technology, Vol. 36, Iss. 5, 2005-07 ,pp. : 566-572

Taylor & Francis Ltd

Access to resources Recommend Favorite

Commutative cancellative semigroups of finite rank

By Cegarra Antonio   Petrich Mario  

Periodica Mathematica Hungarica, Vol. 49, Iss. 2, 2004-12 ,pp. : 35-44

Springer Publishing Company

Access to resources Recommend Favorite

Algorithms for solving generalized equilibrium problems and fixed points of nonexpansive semigroups in Hilbert spaces

By Suantai Suthep   Cholamjiak Prasit  

Optimization, Vol. 63, Iss. 5, 2014-05 ,pp. : 799-815

Taylor & Francis Ltd

Access to resources Recommend Favorite

On Complexity of the Word Problem for Finitely Presented Commutative Semigroups

By Popov V.Y.  

Siberian Mathematical Journal, Vol. 43, Iss. 6, 2002-11 ,pp. : 1086-1093

Springer Publishing Company

Access to resources Recommend Favorite