Author： Kobayashi Y.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.146, Iss.1, 1995-07, pp. : 321-329
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Undecidable properties of monoids with word problem solvable in linear time
Theoretical Computer Science, Vol. 290, Iss. 3, 2003-01 ,pp. :
Access to resources
Recommend
The finiteness of finitely presented monoids
Theoretical Computer Science, Vol. 204, Iss. 1, 1998-09 ,pp. :
By Katsura M. Kobayashi Y. Otto F.
Theoretical Computer Science, Vol. 301, Iss. 1, 2003-05 ,pp. :
Analysing Finitely Presented Groups by Constructing Representations
Journal of Symbolic Computation, Vol. 24, Iss. 3, 1997-09 ,pp. :
Construction of Finitely Presented Lie Algebras and Superalgebras
Journal of Symbolic Computation, Vol. 21, Iss. 3, 1996-03 ,pp. :