The equivalence problem for two dpda's, one of which is a finite-turn or one-counter machine
- 31 December 1981
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 23 (3) , 366-382
- https://doi.org/10.1016/0022-0000(81)90072-6
Abstract
No abstract availableKeywords
Funding Information
- Ministry of Education, Culture, Sports, Science and Technology
This publication has 14 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
- Two decidability results for deterministic pushdown automataJournal of Computer and System Sciences, 1979
- On equivalence and subclass containment problems for deterministic context-free languagesInformation Processing Letters, 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
- An improvement on valiant's decision procedure for equivalence of deterministic finite turn pushdown machinesTheoretical Computer Science, 1976
- The equivalence problem for deterministic finite-turn pushdown automataInformation and Control, 1974
- Properties of deterministic top-down grammarsInformation and Control, 1970
- Deterministic context free languagesInformation and Control, 1966