TY - JOUR
T1 - On equivalence of grammars through transformation trees
AU - Harrison, Michael A.
AU - Havel, Ivan M.
AU - Yehudai, Amiram
N1 - Funding Information:
* Research supported by National Science Foundation Grants GJ-43332 and MCS74-076 36AOI . ** Present address: CSAV, Pod vodarenskou vezi 4, 18208 Praha 8, Czechoslovakia. *** Present address: Division of Computer Science, Tel-Aviv Universit>e, Ramat-Aviv, Tel-Aviv, Israel.
PY - 1979/8
Y1 - 1979/8
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0000126984&partnerID=8YFLogxK
U2 - 10.1016/0304-3975(79)90024-0
DO - 10.1016/0304-3975(79)90024-0
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0000126984
SN - 0304-3975
VL - 9
SP - 173
EP - 205
JO - Theoretical Computer Science
JF - Theoretical Computer Science
IS - 2
ER -