Membership problems for regular and context-free trace languages

被引：0

|

作者：

机构：

[1] Bertoni, A.

[2] Mauri, G.

[3] Sabadini, N.

来源：

Bertoni, A. | 1600年 / 82期

关键词：

Membership Problems - NP Completeness - Trace Languages;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

收藏

相关论文

共 50 条

[41] 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
[42] NATURAL LANGUAGES AND CONTEXT-FREE LANGUAGES
PULLUM, GK
GAZDAR, G
LINGUISTICS AND PHILOSOPHY, 1982, 4 (04) : 471 - 504
[43] On the commutative equivalence of bounded context-free and regular languages: The code case
D'Alessandro, Flavio
Intrigila, Benedetto
THEORETICAL COMPUTER SCIENCE, 2015, 562 : 304 - 319
[44] Stochastic Context-Free Grammars, Regular Languages, and Newton's Method
Etessami, Kousha
Stewart, Alistair
Yannakakis, Mihalis
AUTOMATA, LANGUAGES, AND PROGRAMMING, PT II, 2013, 7966 : 199 - 211
[45] Regular Approximation of Weighted Linear Nondeleting Context-Free Tree Languages
Teichmann, Markus
IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2016, 9705 : 273 - 284
[46] CLASSES OF REGULAR AND CONTEXT-FREE LANGUAGES OVER COUNTABLY INFINITE ALPHABETS
OTTO, F
DISCRETE APPLIED MATHEMATICS, 1985, 12 (01) : 41 - 56
[47] PARALLEL CONTEXT-FREE LANGUAGES
SKYUM, S
INFORMATION AND CONTROL, 1974, 26 (03): : 280 - 285
[48] ON ENTROPY OF CONTEXT-FREE LANGUAGES
KUICH, W
INFORMATION AND CONTROL, 1970, 16 (02): : 173 - +
[49] ON THE RECOGNITION OF CONTEXT-FREE LANGUAGES
RYTTER, W
LECTURE NOTES IN COMPUTER SCIENCE, 1985, 208 : 318 - 325
[50] CONTEXT-FREE AND STATIONARY LANGUAGES
THIERRIN, G
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1979, 7 (04) : 297 - 301

← 1 2 3 4 5 →