INTERCALATION THEOREMS FOR PUSHDOWN STORE AND STACK LANGUAGES,
Abstract
The thesis develops necessary conditions for languages to be context-free, deterministic context-free, stack generable, stack decidable, and non-erasing stack generable. The result for context-free languages is a generalization of the well known necessary condition of Bar-Hillel et al., but it does provide an alternative approach to inherent ambiguity in context-free languages. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Dec 01, 1968
- Accession Number
- AD0682981
Entities
People
- William Frederick Ogden
Organizations
- Stanford University