Abstract
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.
Original language | Undefined |
---|---|
Pages | 420-429 |
Number of pages | 10 |
DOIs | |
Publication status | Published - Sep 1977 |
Event | Mathematical Foundations of Computer Science 1977 - Tatranská Lomnica, Czechoslovakia Duration: 5 Sep 1977 → 9 Sep 1977 |
Conference
Conference | Mathematical Foundations of Computer Science 1977 |
---|---|
Period | 5/09/77 → 9/09/77 |
Other | 5-9 Sep 1977 |
Keywords
- IR-66789
- HMI-SLT: Speech and Language Technology
- EWI-8808