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 条

[21] On the commutative equivalence of bounded context-free and regular languages
D'Alessandro, Flavio
Intrigila, Benedetto
ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2011, (63): : 112 - +
[22] Practical experiments with regular approximation of context-free languages
Nederhof, MJ
COMPUTATIONAL LINGUISTICS, 2000, 26 (01) : 17 - 44
[23] Computation of distances for regular and context-free probabilistic languages
Nederhof, Mark-Jan
Satta, Giorgio
THEORETICAL COMPUTER SCIENCE, 2008, 395 (2-3) : 235 - 254
[24] Regular expressions and context-free grammars for picture languages
Matz, O
STACS 97 - 14TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 1997, 1200 : 283 - 294
[25] Detecting patterns in finite regular and context-free languages
Rampersad, Narad
Shallit, Jeffrey
INFORMATION PROCESSING LETTERS, 2010, 110 (03) : 108 - 112
[26] THE MEMBERSHIP PROBLEM FOR CONTEXT-FREE CHAIN CODE PICTURE LANGUAGES
HINZ, F
LECTURE NOTES IN COMPUTER SCIENCE, 1990, 452 : 329 - 336
[27] COMPLEXITY OF MEMBERSHIP PROBLEM FOR SOME EXTENSIONS OF CONTEXT-FREE LANGUAGES
SUDBOROUGH, IH
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1977, 6 (03) : 191 - 215
[28] Context-free languages via coalgebraic trace semantics
Hasuo, I
Jacobs, B
ALGEBRA AND COALGEBRA IN COMPUTER SCIENCE, PROCEEDINGS, 2005, 3629 : 213 - 231
[29] Finite turns and the regular closure of linear context-free languages
Kutrib, Martin
Malcher, Andreas
DISCRETE APPLIED MATHEMATICS, 2007, 155 (16) : 2152 - 2164
[30] A complete refinement procedure for regular separability of context-free languages
Gange, Graeme
Navas, Jorge A.
Schachte, Peter
Sondergaard, Harald
Stuckey, Peter J.
THEORETICAL COMPUTER SCIENCE, 2016, 625 : 1 - 24

← 1 2 3 4 5 →