On representation of context-free languages by diagonals of linear laguages
Prikladnaâ diskretnaâ matematika, no. 12 (2010), pp. 82-83
Citer cet article
Voir la notice de l'article provenant de la source Math-Net.Ru
A sufficient condition for a symbolic equation system to determine a context-free language closely connected with a linear language by the simple procedure of diagonalization is presented.
[1] Glushkov V. M., Tseitlin G. E., Yuschenko E. L., Algebra, yazyki, programmirovanie, Naukova dumka, Kiev, 1974, 328 pp. | MR | Zbl
[2] Safonov K. V., Egorushkin O. I., “O sintaksicheskom analize i probleme V. M. Glushkova raspoznavaniya kontekstno-svobodnykh yazykov Khomskogo”, Vestnik Tomskogo gosuniversiteta, 2006, Prilozhenie No 17, 63–66