Superdeterministic DPDAs: The method of accepting does affect decision problems
- 1 August 1979
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 19 (1) , 79-117
- https://doi.org/10.1016/0022-0000(79)90015-1
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Two decidability results for deterministic pushdown automataJournal of Computer and System Sciences, 1979
- 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
- A direct algorithm for checking equivalence of LL(k) grammarsTheoretical Computer Science, 1977
- An improvement on valiant's decision procedure for equivalence of deterministic finite turn pushdown machinesTheoretical Computer Science, 1976
- The inclusion problem for simple languagesTheoretical Computer Science, 1976
- Some remarks on the KH algorithm fors-grammarsBIT Numerical Mathematics, 1973
- Characteristic and ultrarealtime languagesInformation and Control, 1971
- One-way stack automataJournal of the ACM, 1967
- A variant of a recursively unsolvable problemBulletin of the American Mathematical Society, 1946