The equivalence problem for some non-real-time deterministic pushdown automata
- 1 October 1982
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 29 (4) , 1166-1181
- https://doi.org/10.1145/322344.322357
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- The equivalence problem for real-time strict deterministic languagesInformation and Control, 1980
- On equivalence of grammars through transformation treesTheoretical Computer Science, 1979
- Linearity is polynomially decidable for realtime pushdown store automataInformation and Control, 1979
- Two decidability results for deterministic pushdown automataJournal of Computer and System Sciences, 1979
- A note on non-singular deterministic pushdown automataTheoretical Computer Science, 1978
- The decidability of equivalence for deterministic stateless pushdown automataInformation and Control, 1978
- 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
- Properties of deterministic top-down grammarsInformation and Control, 1970