The equivalence problem for deterministic pushdown automata is decidable
- 1 January 1997
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Decidability of bisimulation equivalence for normed pushdown processesLecture Notes in Computer Science, 1996
- Hard sets method and semilinear reservoir method with applicationsPublished by Springer Nature ,1996
- Recursive Applicative Program SchemesPublished by Elsevier ,1990
- The equivalence problem for real-time DPDAsJournal of the ACM, 1987
- An axiomatic approach to the Korenjak-Hopcroft algorithmsTheory of Computing Systems, 1983
- On equivalence of grammars through transformation treesTheoretical Computer Science, 1979
- An improvement on valiant's decision procedure for equivalence of deterministic finite turn pushdown machinesTheoretical Computer Science, 1976
- Deterministic one-counter automataJournal of Computer and System Sciences, 1975
- The equivalence problem for deterministic finite-turn pushdown automataInformation and Control, 1974
- Deterministic context free languagesInformation and Control, 1966