Author： Carrere F.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.161, Iss.1, 1996-07, pp. : 23-68
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 Polynomial-Time Parsing Algorithm for K -Depth Languages
Journal of Computer and System Sciences, Vol. 52, Iss. 1, 1996-02 ,pp. :
Access to resources
Recommend
On the Complexity of Adjacent Resource Scheduling
Journal of Scheduling, Vol. 9, Iss. 1, 2006-02 ,pp. :
The Charleston Advisor, Vol. 10, Iss. 3, 2009-01 ,pp. :
Theoretical Computer Science, Vol. 215, Iss. 1, 1999-02 ,pp. :
Learning approximately regular languages with reversible languages
Theoretical Computer Science, Vol. 174, Iss. 1, 1997-03 ,pp. :