On equivalence of grammars through transformation trees
- 31 August 1979
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 9 (2) , 173-205
- https://doi.org/10.1016/0304-3975(79)90024-0
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Two decidability results for deterministic pushdown automataJournal of Computer and System Sciences, 1979
- A direct algorithm for checking equivalence of LL(k) grammarsTheoretical Computer Science, 1977
- Normal forms of deterministic grammarsDiscrete Mathematics, 1976
- The inclusion problem for simple languagesTheoretical Computer Science, 1976
- On the Parsing of Deterministic LanguagesJournal of the ACM, 1974
- Some remarks on the KH algorithm fors-grammarsBIT Numerical Mathematics, 1973
- Strict deterministic grammarsJournal of Computer and System Sciences, 1973
- Properties of deterministic top-down grammarsInformation and Control, 1970
- On the equivalence and containment problems for context-free languagesTheory of Computing Systems, 1969
- A New Normal-Form Theorem for Context-Free Phrase Structure GrammarsJournal of the ACM, 1965