Context-free grammar forms

Journal of Computer and System Sciences - Tập 11 - Trang 86-117 - 1975
Armin Cremers1, Seymour Ginsburg1
1University of Southern California, Los Angeles, California 90007, USA

Tài liệu tham khảo

Chomsky, 1959, On certain formal properties of grammars, Inform. Contr., 2, 137, 10.1016/S0019-9958(59)90362-6 Chomsky, 1963, The algebraic theory of context-free languages, 118 Gabrielian, 1974, Grammar schemata, J. Assoc. Comput. Mach., 21, 213, 10.1145/321812.321817 Ginsburg, 1966 Ginsburg, 1975 Ginsburg, 1966, Finite-turn pushdown automata, SIAM J. Control, 4, 429, 10.1137/0304034 Ginsburg, 1968, Derivation-bounded languages, J. Comput. System Sci., 5, 228, 10.1016/S0022-0000(68)80009-1 S. Ginsburg and E. H. Spanier, Substitution of grammar forms, to appear. Greibach, 1972, Simple syntactic operators on full semi-AFL's, J. Comput. System Sci., 6, 30, 10.1016/S0022-0000(72)80039-4 Greibach, 1969, Independence of AFL operations, 33 Maurer, 1969 Nivat, 1967, Transductions des langages de Chomsky, Ph.D. Thesis, Paris Salomaa, 1969, On the index of context-free grammars and languages, Inform. Contr., 14, 474, 10.1016/S0019-9958(69)90164-8 Stanley, 1965, Finite State Representations of Context-Free Languages, MIT Research Laboratory Quarterly Progress Report, 276 Yntema, 1967, Inclusion relations among families of context-free languages, Inform. Contr., 10, 572, 10.1016/S0019-9958(67)91032-7