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. Melnikov, B., Korabelshchikova, S., Dolgov, V.: On the task of extracting the root from the language. Int. J. Open Inf. Technol. 7(3), 1–6 (2019)
3. Melnikov, B., Melnikova, A.: The problem of equality in the class of bracketed languages and its use in automation systems for building compilers. In: IOP Conference Series: Materials Science and Engineering, vol. 919, no. 5, p. 052061 (2020)
4. Meytus, V.: The solvability of the equivalence problem of deterministic pushdown automata. Cybern. Syst. Anal. 5, 20–45 (1992). (in Russian)
5. Staneviciené, L.: D-graphs in context-free language theory. Informatica (Lithuanian Acad. Sci. Ed.) 8(1), 43–56 (1997)