CONTROL SETS ON GRAMMARS.
Scientific rept. no. 9,
SYSTEM DEVELOPMENT CORP SANTA MONICA CALIF
Pagination or Media Count:
Given a set C of strings of rewriting rules of a phrase structure grammar G, we consider the set LCG of those words generated by leftmost derivations in G whose corresponding string of rewriting rules is an element of C. The paper concerns the nature of the set LCG when C and G are assumed to have special form. For example, for G an arbitrary phase structure grammar, LCG is an abstract family of languages if C is an abstract family of languages, and LCG is bounded if C is bounded. Author