Equivalence problems for deterministic context-free languages and monadic recursion schemes
- 30 June 1977
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 14 (3) , 344-359
- https://doi.org/10.1016/s0022-0000(77)80019-6
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Jump PDA’s and Hierarchies of Deterministic Context-Free LanguagesSIAM Journal on Computing, 1974
- Decidable Properties of Monadic Functional SchemasJournal of the ACM, 1973
- Strict deterministic grammarsJournal of Computer and System Sciences, 1973
- Program schemes, recursion schemes, and formal languagesJournal of Computer and System Sciences, 1973
- Real-Time Definable LanguagesJournal of the ACM, 1967
- Deterministic context free languagesInformation and Control, 1966