Analysing Finitely Presented Groups by Constructing Representations

By Plesken W.   Souvignier B.  

Journal of Symbolic Computation, Vol. 24, Iss. 3, 1997-09 ,pp. : 335-349

Academic Press

Access to resources Recommend Favorite

Construction of Finitely Presented Lie Algebras and Superalgebras

By Gerdt V.P.   Kornyak V.V.  

Journal of Symbolic Computation, Vol. 21, Iss. 3, 1996-03 ,pp. : 337-349

Academic Press

Access to resources Recommend Favorite

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

By Katsura M.   Kobayashi Y.   Otto F.  

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

Elsevier

Access to resources Recommend Favorite

A finitely presented monoid which has solvable word problem but has no regular complete presentation

By Kobayashi Y.  

Theoretical Computer Science, Vol. 146, Iss. 1, 1995-07 ,pp. : 321-329

Elsevier

Access to resources Recommend Favorite

Commutativity in free inverse monoids

By Choffrut C.   D'Alessandro F.  

Theoretical Computer Science, Vol. 204, Iss. 1, 1998-09 ,pp. : 35-54

Elsevier

Access to resources Recommend Favorite