UNSOLVABILITY OF RECOGNITION OF LINEAR CONTEXT-FREE LANGUAGES

被引：33

|

作者：

GREIBACH, SA

机构：

来源：

JOURNAL OF THE ACM | 1966年 / 13卷 / 04期

关键词：

D O I：

10.1145/321356.321365

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

收藏

页码：582 / &

相关论文

共 50 条

[41] TRANSFORMATIONS IN CONTEXT-FREE LANGUAGES
RADENSKY, AA
DOKLADI NA BOLGARSKATA AKADEMIYA NA NAUKITE, 1983, 36 (02): : 185 - 187
[42] Buchi context-free languages
Esik, Zoltan
Ivan, Szabolcs
THEORETICAL COMPUTER SCIENCE, 2011, 412 (8-10) : 805 - 821
[43] PARALLEL CONTEXT-FREE LANGUAGES
SIROMONEY, R
KRITHIVASAN, K
INFORMATION AND CONTROL, 1974, 24 (02): : 155 - 162
[44] Kernels of Context-Free Languages
Kutrib, Martin
Prigioniero, Luca
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2024,
[45] Finite turns and the regular closure of linear context-free languages
Kutrib, Martin
Malcher, Andreas
DISCRETE APPLIED MATHEMATICS, 2007, 155 (16) : 2152 - 2164
[46] Superwords and context-free languages
Dömösi, P
PUBLICATIONES MATHEMATICAE-DEBRECEN, 2000, 56 (3-4): : 313 - 320
[47] A NOTE ON CONTEXT-FREE LANGUAGES
WALTERS, RFC
JOURNAL OF PURE AND APPLIED ALGEBRA, 1989, 62 (02) : 199 - 203
[48] Regular Approximation of Weighted Linear Context-Free Tree Languages
Teichmann, Markus
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2017, 28 (05) : 523 - 542
[49] Growth and ergodicity of context-free languages II: The linear case
Silberstein, Tullio Ceccherini
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 2007, 359 (02) : 605 - 618
[50] Restarting tree automata and linear context-free tree languages
Stamer, Heiko
Otto, Friedrich
ALGEBRAIC INFORMATICS, 2007, 4728 : 275 - 289

← 1 2 3 4 5 →