Control sets on grammars |
| |
| Authors: | Seymour Ginsburg Edwin H Spanier |
| |
| Affiliation: | (1) University of Southern California, USA;(2) System Development Corporation, Santa Monica, California, USA;(3) University of California, Berkeley, USA;(4) System Development Corporation, USA |
| |
| Abstract: | Given a setC of strings of rewriting rules of a phrase structure grammarG, we consider the setL
c
(G) of those words generated by leftmost derivations inG whose corresponding string of rewriting rules is an element ofC. The paper concerns the nature of the setL
c
(G) whenC andG are assumed to have special form. For example, forG an arbitrary phrase structure grammar,L
c
(G) is an abstract family of languages ifC is an abstract family of languages, andL
c
(G) is bounded ifC is bounded.Research sponsored in part by the Air Force Cambridge Research Laboratories, Office of Aerospace Research, USAF, under Contract F1962867C0008, and by the Air Force Office of Scientific Research, Office of Aerospace Research, USAF, under AFOSR Grant No. AF-AFOSR-1203-67. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
