A fast algorithm to decide on simple grammars equivalence
- 1 January 1989
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- An extended direct branching algorithm for checking equivalence of deterministic pushdown automataTheoretical Computer Science, 1984
- An axiomatic approach to the Korenjak-Hopcroft algorithmsTheory of Computing Systems, 1983
- The equivalence problem for real-time strict deterministic languagesInformation and Control, 1980
- The decidability of equivalence for deterministic stateless pushdown automataInformation and Control, 1978
- A direct algorithm for checking equivalence of LL(k) grammarsTheoretical Computer Science, 1977
- Deterministic one-counter automataJournal of Computer and System Sciences, 1975
- The equivalence problem for deterministic finite-turn pushdown automataInformation and Control, 1974
- Some remarks on the KH algorithm fors-grammarsBIT Numerical Mathematics, 1973
- Deterministic context free languagesInformation and Control, 1966