Author： Karhumaki J. Petre I.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.289, Iss.1, 2002-10, pp. : 705-725
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
A three-word code which is not prefix-suffix composed
Theoretical Computer Science, Vol. 163, Iss. 1, 1996-08 ,pp. :
Access to resources
Recommend
The commutation of finite sets: a challenging problem
By Choffrut C. Karhumaki J. Ollinger N.
Theoretical Computer Science, Vol. 273, Iss. 1, 2002-02 ,pp. :
The word problem for 1LC congruences is NP-hard
By Rosaz L.
Theoretical Computer Science, Vol. 306, Iss. 1, 2003-09 ,pp. :