The Equivalence of Reducing Transition Languages and Deterministic Languages,
Abstract
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 the paper the author extends this result showing that in fact, the first class is equivalent to the class of deterministic context free languages. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Jul 01, 1973
- Accession Number
- AD0770029
Entities
People
- Mario Schkolnick
Organizations
- Carnegie Mellon University