On equivalence and subclass containment problems for deterministic context-free languages
- 31 October 1978
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 7 (6) , 287-290
- https://doi.org/10.1016/0020-0190(78)90019-4
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Simple context-free languages and free monadic recursion schemesTheory of Computing Systems, 1977
- Equivalence problems for deterministic context-free languages and monadic recursion schemesJournal of Computer and System Sciences, 1977
- On LR(k) grammars and languagesTheoretical Computer Science, 1977
- Regularity and Related Problems for Deterministic Pushdown AutomataJournal of the ACM, 1975
- Properties of deterministic top-down grammarsInformation and Control, 1970
- An Infinite Hierarchy of Context-Free LanguagesJournal of the ACM, 1969
- Real-Time Definable LanguagesJournal of the ACM, 1967
- A regularity test for pushdown machinesInformation and Control, 1967
- Parenthesis GrammarsJournal of the ACM, 1967
- Deterministic context free languagesInformation and Control, 1966