The decidability of equivalence for deterministic stateless pushdown automata
- 30 September 1978
- journal article
- Published by Elsevier in Information and Control
- Vol. 38 (3) , 367-376
- https://doi.org/10.1016/s0019-9958(78)90139-0
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Completeness results for the equivalence of recursive schemasJournal of Computer and System Sciences, 1976
- Deterministic one-counter automataJournal of Computer and System Sciences, 1975
- The equivalence problem for deterministic finite-turn pushdown automataInformation and Control, 1974
- Properties of deterministic top-down grammarsInformation and Control, 1970