RUS  ENG
Full version
JOURNALS // Prikladnaya Diskretnaya Matematika // Archive
Prikl. Diskr. Mat., 2010 supplement № 3, Pages 82–83 (Mi pdm220)
This article is cited in 1 paper

Mathematical Foundations of Informatics and Programming

On representation of context-free languages by diagonals of linear laguages

K. V. Safonova, D. A. Kalugin-Balashovb

a M. F. Reshetnev Siberian State Aerospace University, Krasnoyarsk
b Siberian Federal University

Abstract: 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.

UDC: 519.682


© Steklov Math. Inst. of RAS, 2025