Undecidable properties of monoids with word problem solvable in linear time. Part II- cross sections and homological and homotopical finiteness conditions

Author： Katsura M.   Kobayashi Y.   Otto F.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.301, Iss.1, 2003-05, pp. : 79-101

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

Undecidable properties of monoids with word problem solvable in linear time

By Katsura M.   Kobayashi Y.  

Theoretical Computer Science, Vol. 290, Iss. 3, 2003-01 ,pp. : 1301-1316

Elsevier

Access to resources Recommend Favorite

The finiteness of finitely presented monoids

By McNaughton R.  

Theoretical Computer Science, Vol. 204, Iss. 1, 1998-09 ,pp. : 169-182

Elsevier

Access to resources Recommend Favorite

Cancellative Abelian Monoids and Related Structures in Refutational Theorem Proving (Part II)

By Waldmann U.  

Journal of Symbolic Computation, Vol. 33, Iss. 6, 2002-06 ,pp. : 831-861

Academic Press

Access to resources Recommend Favorite

A codicity undecidable problem in the plane

By Beauquier D.   Nivat M.  

Theoretical Computer Science, Vol. 303, Iss. 2, 2003-07 ,pp. : 417-430

Elsevier

Access to resources Recommend Favorite

The homomorphism problem for trace monoids

By Silva P.V.  

Theoretical Computer Science, Vol. 307, Iss. 1, 2003-09 ,pp. : 199-215

Elsevier

Access to resources Recommend Favorite