The purpose of this paper was to sketch an area of problems for the concept of cover. We showed that in spite of some remarks in the literature the problem of covering (unambiguous and ɛ-free) cfg's with cfg's in GNF is open. Moreover we gave some properties of covers and we showed a relation between covers and parsability.
CITATION STYLE
Nijholt, A. (1977). Cover results and normal forms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 53 LNCS, pp. 420–429). Springer Verlag. https://doi.org/10.1007/3-540-08353-7_163
Mendeley helps you to discover research relevant for your work.