A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
The undecidability of form equivalence for context-free and E0L forms
1984
Theoretical Computer Science
This paper studies the decidability status of various equivalence problems in form theory. Most of our discussions concern the notion of a language form. We compare the form equivalence problem be!wcen language forms with the ordinary equivaienc'e problem between languages. However, the main results deal with L forms and grammar forms under strict intcrpretations. We prove that the form equivalence problem is undecidable for (a) context-free grammar forms, and (b) EOL forms. The proofs of these
doi:10.1016/0304-3975(84)90045-8
fatcat:dxldpzae6fcpfmuxtdbo42ty2e