Abstract families of context-free grammars

References

• Altman , E. and Banerji , R. 1965 . Some problems of finite representability . Inform. and Contr , 8 : 251 – 263 .
   Google Scholar
• Banerji , R. 1963 . Phrase structure languages, finite machines and channel capacity . Inform. and Contr , 6 : 153 – 162 .
   Google Scholar
• Fleck , A.C. 1969 . On the complexity of grammars , University of Iowa . Tech Report No
   Google Scholar
• Fleck , A.C. 1971 . On the combinatorial complexity of context-free grammars . Proc. IFIP Congress , 71 : 15 – 17 . Booklet TA-2
   Google Scholar
• Cremers , A. and Ginsburg , S. 1975 . Context-free grammar forms . Journal of Comput. and Sys. Sci , 11 : 86 – 117 .
   Google Scholar
• Cremers , A. and Ginsburg , S. 1977 . The structure of context-free grammatical families . Journal of Comput. and Sys. Sci , 15 : 262 – 279 .
   Google Scholar
• Gabrielian , A. and Ginsburg , S. 1974 . Grammar schemata . J. ACM , 21 ( 2 ) : 213 – 226 .
   Web of Science ®Google Scholar
• Ginsburg , S. 1975 . Algebraic and Automata-Theoretic Properties of Formal Languages , Elsevier, New York : North Holland-Am .
   Google Scholar
• Ginsburg , S. and Greibach , S. 1970 . Principal AFL . J. Comp. Sys. Sci , 4 : 308 – 338 .
   Google Scholar
• Ginsburg , S. and Spanier , E.H. 1966 . Derivation bounded languages . J. Comput. Sys. Sci , 2 : 228 – 250 .
   Google Scholar
• Ginsburg , S. and Spanier , E.H. 1966 . Finite-turn push down automata . SIAM J. Control , 4 ( 3 ) : 429 – 453 .
   Google Scholar
• Gruska , J. 1970 . A characterization of context-free languages . J. Comput. Sys. Sci , 5 ( 4 ) : 353 – 364 .
   Google Scholar
• Harrison , M.A. 1978 . Introduction to Formal Language Theory , Reading, Mass : Addison-Wesley .
   Google Scholar
• Moriya , E. 1973 . Associate languages and derivational complexity of formal grammars and Languages . Info and Control , 22 : 139 – 162 .
   Google Scholar
• Wood , D. 1979 . A Survey of Grammar and L Forms , McMaster University . Report 79-CS3
   Google Scholar
• Workman , D. 1973 . The Structural Complexity of Context-Free Grammars and Languages , University of Iowa . Tech. Report 79-09
   Google Scholar
• Workman , D. 1974 . Abstract Families of Context-free Grammars , Purdue University . Tech. Report CSD TR-114
   Google Scholar