Author： Tomescu I.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.290, Iss.3, 2003-01, pp. : 2031-2035
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
On words containing all short subwords
By Tomescu I.
Theoretical Computer Science, Vol. 197, Iss. 1, 1998-05 ,pp. :
Access to resources
Recommend
On the number of occurrences of a symbol in words of regular languages
By Bertoni A. Choffrut C. Goldwurm M. Lonati V.
Theoretical Computer Science, Vol. 302, Iss. 1, 2003-06 ,pp. :
Almost all graphs with average degree 4 are 3-colorable
Journal of Computer and System Sciences, Vol. 67, Iss. 2, 2003-09 ,pp. :
A few logs suffice to build (almost) all trees: Part II
By Erdos P.L. Steel M.A. Szekely L.A. Warnow T.J.
Theoretical Computer Science, Vol. 221, Iss. 1, 1999-06 ,pp. :
DNF tautologies with a limited number of occurrences of every variable
By Savicky
Theoretical Computer Science, Vol. 238, Iss. 1, 2000-05 ,pp. :