Degree-languages: A new concept of acceptance

Book, 1970, Time- and tape-bounded turing acceptors and AFLs, J. Comput. System Sci., 4, 606, 10.1016/S0022-0000(70)80031-9 Book, 1970, Tape-bounded turing acceptors and principla AFLs, J. Comput. System Sci., 4, 622, 10.1016/S0022-0000(70)80032-0 Aho, 1968, Indexed grammars, an extension of context-free grammars, J. Assoc. Comput. Mach., 15, 647, 10.1145/321479.321488 Chomsky, 1957 Chomsky, 1959, On certain formal properties of grammars, Information and Control, 2, 137, 10.1016/S0019-9958(59)90362-6 Ginsburg, 1967, Stack-automata and compiling, J. Assoc. Comput. Mach., 14, 172, 10.1145/321371.321385 Ginsburg, 1967, One-Way stack automata, J. Assoc. Comput. Mach., 14, 389, 10.1145/321386.321403 Ginsburg, 1968, Control sets on grammars, Math. Systems Theory, 2, 159, 10.1007/BF01692513 Ginsburg, 1969 Gray, 1967, Two-way pushdown automata, Information and Control, 11, 30, 10.1016/S0019-9958(67)90369-5 Greibach, 1969, Scattered context grammars, J. Comput. System Sci., 3, 233, 10.1016/S0022-0000(69)80015-2 Hopcroft, 1969 H. B. Hunt, III, On the complexity of finite, pushdown, and stack automata, submitted for publication. Rosenberg, 1967, Multitape finite automata with rewind instructions, J. Comput. System Sci., 1, 299, 10.1016/S0022-0000(67)80021-7 Rosenkrantz, 1969, Programmed grammars and classes of formal languages, J. Assoc. Comput. Mach., 16, 107, 10.1145/321495.321504 Salomaa, 1973 Savitch, 1970, Relationships between nondeterministic and deterministic tape complexities, J. Comput. System Sci., 4, 177, 10.1016/S0022-0000(70)80006-X Valiant, 1974, “General Context-Free Recognition in Less Than Cubic Time”, Pittsburgh, Pa. Liu, 1973, An infinite hierarchy of intersections of context-free languages, Math. Systems Theory, 7, 185, 10.1007/BF01762237 Wotschke, 1973, The Boolean closures of the deterministic and nondeterministic context-free languages, Vol. 1, 113