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.
|Number of pages||10|
|Publication status||Published - Sep 1977|
- HMI-SLT: Speech and Language Technology