scientific article; zbMATH DE number 3992939

From MaRDI portal
Publication:4720792





[For the entire collection see Zbl 0593.00024.] Two closely related types of context-free grammars called \(\bar X\) (read x-bar) and strong \(\bar X\) grammars are presented along the lines of \textit{R. Jackendoff} [\(\bar X\) Syntax: A study of phrase structure, Cambridge, Mass. (1977)]. The family E of languages generated by strong \(\bar X\) grammars is properly included in the family K of languages generated by \(\bar X\) grammars which, in turn, is a proper subset of the context-free family \(L_ 2\). E and K cannot be compared with the regular, OL and TOL families, and both are anti-AFLs.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4720792)