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 条

[31] ON CONTEXT-FREE LANGUAGES
PARIKH, RJ
JOURNAL OF THE ACM, 1966, 13 (04) : 570 - +
[32] Regular Approximation of Weighted Linear Context-Free Tree Languages
Teichmann, Markus
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2017, 28 (05) : 523 - 542
[33] EFFICIENT CONSTRUCTIONS OF TEST SETS FOR REGULAR AND CONTEXT-FREE LANGUAGES
KARHUMAKI, J
RYTTER, W
JAROMINEK, S
LECTURE NOTES IN COMPUTER SCIENCE, 1991, 520 : 249 - 258
[34] Regular and Context-Free Pattern Languages over Small Alphabets
Reidenbach, Daniel
Schmid, Markus L.
DEVELOPMENTS IN LANGUAGE THEORY (DLT 2012), 2012, 7410 : 130 - 141
[35] EFFICIENT CONSTRUCTIONS OF TEST SETS FOR REGULAR AND CONTEXT-FREE LANGUAGES
KARHUMAKI, J
RYTTER, W
JAROMINEK, S
THEORETICAL COMPUTER SCIENCE, 1993, 116 (02) : 305 - 316
[36] Regular and context-free pattern languages over small alphabets
Reidenbach, Daniel
Schmid, Markus L.
THEORETICAL COMPUTER SCIENCE, 2014, 518 : 80 - 95
[37] THE COMPLEXITY OF CONNECTIVITY PROBLEMS ON CONTEXT-FREE GRAPH LANGUAGES
WANKE, E
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 380 : 470 - 479
[38] SOME EXPTIME COMPLETE PROBLEMS ON CONTEXT-FREE LANGUAGES
KASAI, T
IWATA, S
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 1993, E76D (03) : 329 - 335
[39] THE COMPLEXITY OF CONNECTIVITY PROBLEMS ON CONTEXT-FREE GRAPH LANGUAGES
WANKE, E
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1994, 49 (01) : 57 - 82
[40] An Automata-Theoretical Characterization of Context-Free Trace Languages
Nagy, Benedek
Otto, Friedrich
SOFSEM 2011: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2011, 6543 : 406 - 417

← 1 2 3 4 5 →