Author： Ananichev D.S. Cherubini A. Volkov M.V.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.307, Iss.1, 2003-09, pp. : 77-92
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
Access to resources
Recommend
Computing Sylow Subgroups in Permutation Groups
Journal of Symbolic Computation, Vol. 24, Iss. 3, 1997-09 ,pp. :
On lengths of words in context-free languages
By Ilie
Theoretical Computer Science, Vol. 242, Iss. 1, 2000-07 ,pp. :
Graphical Models and Image Processing, Vol. 60, Iss. 2, 1998-03 ,pp. :
On repetition-free binary words of minimal density
By Kolpakov R. Kucherov G. Tarannikov Y.
Theoretical Computer Science, Vol. 218, Iss. 1, 1999-04 ,pp. :