Accession Number:

AD0661970

Title:

CONTROL SETS ON GRAMMARS.

Descriptive Note:

Scientific rept. no. 9,

Corporate Author:

SYSTEM DEVELOPMENT CORP SANTA MONICA CALIF

Personal Author(s):

Report Date:

1967-08-07

Pagination or Media Count:

40.0

Abstract:

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

Subject Categories:

  • Linguistics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE