Author： Rytter W.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.143, Iss.2, 1995-06, pp. : 343-352
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 Version Space Approach to Learning Context-free Grammars
By Vanlehn K.
Machine Learning, Vol. 02, Iss. 1, 1987-01 ,pp. :
Access to resources
Recommend
A Branch-Checking Algorithm for All-Pairs Shortest Paths
By Duin Cees
Algorithmica, Vol. 41, Iss. 2, 2004-11 ,pp. :
A fully dynamic algorithm for distributed shortest paths
By Cicerone S. Di Stefano G. Frigioni D. Nanni U.
Theoretical Computer Science, Vol. 297, Iss. 1, 2003-03 ,pp. :
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. :