The Equivalence of Reducing Transition Languages and Deterministic Languages The class of reducing transition languages introduced by Eickel, Paul, Bauer, and Samelson was shown by Morris to be a proper superclass of the simple precedence languages. In this paper this result is extended, showing that, in fact, the first class is equivalent to the class of deterministic context free languages. CACM September, 1974 Schkolnick, M. reducing transition languages, syntax controlled generators, deterministic context-free grammars 4.12 5.23 CA740905 JB January 17, 1978 8:52 AM 1215 4 2603 1542 4 2603 1683 4 2603 1693 4 2603 1781 4 2603 1781 4 2603 1787 4 2603 1787 4 2603 1836 4 2603 1945 4 2603 1945 4 2603 2060 4 2603 2061 4 2603 2082 4 2603 2091 4 2603 2152 4 2603 2179 4 2603 2340 4 2603 2356 4 2603 2546 4 2603 2603 4 2603 2603 4 2603 2698 4 2603 2708 4 2603 2824 4 2603 2982 4 2603 2986 4 2603 3045 4 2603 3093 4 2603 1491 5 2603 2603 5 2603 2603 5 2603 2603 5 2603 763 5 2603