On equivalence of grammars through transformation trees

Michael A. Harrison*, Ivan M. Havel, Amiram Yehudai

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

37 Scopus citations

Abstract

One approach to solving the equivalence problem for certain families of context free languages is through the use of 'transformation trees'. We explore this approach in general. The methods developed provide a clear and complete proof of the decidability of the equivalence problem for 'simple' languages. It is shown how to decide the equivalence problem for two deterministic context free languages, one of which is simple.

Original languageEnglish
Pages (from-to)173-205
Number of pages33
JournalTheoretical Computer Science
Volume9
Issue number2
DOIs
StatePublished - Aug 1979
Externally publishedYes

Funding

FundersFunder number
National Science FoundationMCS74-076 36AOI, GJ-43332
National Science Foundation

    Fingerprint

    Dive into the research topics of 'On equivalence of grammars through transformation trees'. Together they form a unique fingerprint.

    Cite this