UNSOLVABILITY OF RECOGNITION OF LINEAR CONTEXT-FREE LANGUAGES

被引：33

作者：

GREIBACH, SA

机构：

来源：

关键词：

D O I：

10.1145/321356.321365

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：582 / &

共 50 条

[21] Linear automata with translucent letters and linear context-free trace languages*
Nagy, Benedek
Otto, Friedrich
RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2020, 54
[22] PARALLEL CONTEXT-FREE LANGUAGES
SKYUM, S
INFORMATION AND CONTROL, 1974, 26 (03): : 280 - 285
[23] FAST RECOGNITION OF PUSHDOWN AUTOMATON AND CONTEXT-FREE LANGUAGES.
Rytter, Wojciech
Information and control, 1984, 67 (1-3):
[24] Analysis of algorithms for the recognition of rational and context-free trace languages
Avellone, A
Goldwurm, M
RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1998, 32 (4-6): : 141 - 152
[25] AN ETA-2 ALGORITHM FOR RECOGNITION OF CONTEXT-FREE LANGUAGES
IORDZHEV, K
CYBERNETICS AND SYSTEMS ANALYSIS, 1993, 29 (06) : 922 - 927
[26] ON ENTROPY OF CONTEXT-FREE LANGUAGES
KUICH, W
INFORMATION AND CONTROL, 1970, 16 (02): : 173 - +
[27] CONTEXT-FREE AND STATIONARY LANGUAGES
THIERRIN, G
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1979, 7 (04) : 297 - 301
[28] CONTEXT-FREE FUZZY LANGUAGES
SANTOS, ES
INFORMATION AND CONTROL, 1974, 26 (01): : 1 - 11
[29] Logics for context-free languages
Lautemann, C
Schwentick, T
Therien, D
COMPUTER SCIENCE LOGIC, 1995, 933 : 205 - 216
[30] ON REGULARITY OF CONTEXT-FREE LANGUAGES
EHRENFEUCHT, A
HAUSSLER, D
ROZENBERG, G
THEORETICAL COMPUTER SCIENCE, 1983, 27 (03) : 311 - 332