On representation of context-free languages by diagonals of linear laguages
Prikladnaâ diskretnaâ matematika, no. 12 (2010), pp. 82-83
Cet article a éte moissonné depuis 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.
@article{PDM_2010_12_a40,
author = {K. V. Safonov and D. A. Kalugin-Balashov},
title = {On representation of context-free languages by diagonals of linear laguages},
journal = {Prikladna\^a diskretna\^a matematika},
pages = {82--83},
year = {2010},
number = {12},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/PDM_2010_12_a40/}
}
K. V. Safonov; D. A. Kalugin-Balashov. On representation of context-free languages by diagonals of linear laguages. Prikladnaâ diskretnaâ matematika, no. 12 (2010), pp. 82-83. http://geodesic.mathdoc.fr/item/PDM_2010_12_a40/
[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