Two decidability results for deterministic pushdown automata
- 28 February 1979
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 18 (1) , 92-107
- https://doi.org/10.1016/0022-0000(79)90055-2
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- A result on the equivalence problem for deterministicpushdown automataJournal of Computer and System Sciences, 1976
- The inclusion problem for simple languagesTheoretical Computer Science, 1976
- Formal translations and Szilard languagesInformation and Control, 1976
- Deterministic one-counter automataJournal of Computer and System Sciences, 1975
- The equivalence problem for deterministic finite-turn pushdown automataInformation and Control, 1974
- On derivation languages corresponding to context-free grammarsActa Informatica, 1974
- Strict deterministic grammarsJournal of Computer and System Sciences, 1973
- Associate languages and derivational complexity of formal grammars and languagesInformation and Control, 1973
- Properties of deterministic top-down grammarsInformation and Control, 1970