1. “The Theory of Parsing, Translation, and Compiling.”;Aho,1972
2. Test sets for homomorphism equivalence on context-free languages;Albert,1979
3. The unsolvability of the equality problem for sentential forms of context-free languages;Blattner;J. Comp. System Sci.,1973
4. Book, R., and Brandenburg, F.-J., Representing complexity classes by equality sets. Proceedings of the Sixth ICALP, Graz, Lecture Notes in Computer Science 71, Springer Verlag, 49–57 (1979).
5. Equality sets and complexity classes;Book;SIAM J. Computing,1980