Jump PDA’s and Hierarchies of Deterministic Context-Free Languages
- 1 June 1974
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 3 (2), 111-127
- https://doi.org/10.1137/0203009
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- A characterization of context-free languagesJournal of Computer and System Sciences, 1971
- Deterministic Pushdown Store Machines and Real-Time ComputationJournal of the ACM, 1971
- Characteristic and ultrarealtime languagesInformation and Control, 1971
- Properties of deterministic top-down grammarsInformation and Control, 1970
- Full AFLs and nested iterated substitutionInformation and Control, 1970
- An Infinite Hierarchy of Context-Free LanguagesJournal of the ACM, 1969
- An Approach to a Unified Theory of AutomataBell System Technical Journal, 1967
- Parenthesis GrammarsJournal of the ACM, 1967
- Deterministic context free languagesInformation and Control, 1966
- On the translation of languages from left to rightInformation and Control, 1965