Author: Hirshfeld Y. Jerrum M. Moller F.
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.158, Iss.1, 1996-05, pp. : 143-159
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 new algorithm for regularizing one-letter context-free grammars
By Andrei S. Cavadini S.V. Chin W.-N.
Theoretical Computer Science, Vol. 306, Iss. 1, 2003-09 ,pp. :
Context-free recognition via shortest paths computation: a version of Valiant's algorithm
By Rytter W.
Theoretical Computer Science, Vol. 143, Iss. 2, 1995-06 ,pp. :
Cooperation in context-free grammars
Theoretical Computer Science, Vol. 180, Iss. 1, 1997-06 ,pp. :
Length considerations in context-free languages
By Raz D.
Theoretical Computer Science, Vol. 183, Iss. 1, 1997-08 ,pp. :