1. Melnikov, B.: The equality condition for infinite catenations of two sets of finite words. Int. J. Found. Comput. Sci. 4(3), 267–274 (1993)
2. Mel’nikov, B.: Some consequences of equivalence condition of unambiguous peranthesis grammar. Bull. Moscow Univ. 10, 51–53 (1991)
3. Aho, A.V., Ullman, J.D.: The Theory of Parsing, Translation, and Compiling, vol. 1. Parsing. Prentice-Hall, Inc., Upper Saddle River (1972)
4. Sénizergues, G.: L(A) = L(B)? decidability results from complete formal systems. Theoret. Comput. Sci. 251(1–2), 1–166 (2001)
5. Staneviciené, L.: About a tool for the study of context-free languages. Cybernetics 4, 135–136 (1989)