Characterization of Context-Free Grammatical Families
暂无分享,去创建一个
Two characterization theorems for the class of context-free grammatical families are given. The characterizations are expressed in terms of the family of regular sets, the family of linear sets, and the following language-family operators: union, concatenation, the full semi-AFL operator, the full AFL operator, and a new ternary substitution operator.
[1] Mary Katherine Yntema,et al. Inclusion Relations Among Families Of Context-Free Languages , 1967, Inf. Control..
[2] Armin B. Cremers,et al. Context-Free Grammar Forms , 1974, J. Comput. Syst. Sci..