Nonterminal complexity of some operations on context-free languages

被引：0

|

作者：

Otto-von-Guericke-Universität Magdeburg, Fakultät für Informatik, PSF 4120, D-39016 Magdeburg, Germany ^{[1
]}

机构：

来源：

Fundam Inf | 2008年 / 1-2卷 / 35-49期

关键词：

Context free languages;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

收藏

相关论文

共 50 条

[1] Nonterminal complexity of some operations on context-free languages
Dassow, Juergen
Stiebe, Ralf
FUNDAMENTA INFORMATICAE, 2008, 83 (1-2) : 35 - 49
[2] Production Complexity of Some Operations on Context-Free Languages
Dassow, Juergen
Harbich, Ronny
DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2012, 2012, 7386 : 141 - 154
[3] CONTEXT-FREE COMPLEXITY OF FINITE LANGUAGES
BUCHER, W
MAURER, HA
CULIK, K
THEORETICAL COMPUTER SCIENCE, 1984, 28 (03) : 277 - 285
[4] COMPLEXITY OF MEMBERSHIP PROBLEM FOR SOME EXTENSIONS OF CONTEXT-FREE LANGUAGES
SUDBOROUGH, IH
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1977, 6 (03) : 191 - 215
[5] STRUCTURAL COMPLEXITY OF CONTEXT-FREE LANGUAGES
KOBAYASHI, K
INFORMATION AND CONTROL, 1971, 18 (04): : 299 - +
[6] TAPE COMPLEXITY OF DETERMINISTIC CONTEXT-FREE LANGUAGES
SUDBOROUGH, IH
JOURNAL OF THE ACM, 1978, 25 (03) : 405 - 414
[7] Complexity results on balanced context-free languages
Tozawa, Akihiko
Minamide, Yasuhiko
FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATIONAL STRUCTURES, PROCEEDINGS, 2007, 4423 : 346 - +
[8] COMPLEXITY AND UNAMBIGUITY OF CONTEXT-FREE GRAMMARS AND LANGUAGES
GRUSKA, J
INFORMATION AND CONTROL, 1971, 18 (05): : 502 - &
[9] ON THE CONTEXT-FREE PRODUCTION COMPLEXITY OF FINITE LANGUAGES
TUZA, Z
DISCRETE APPLIED MATHEMATICS, 1987, 18 (03) : 293 - 304
[10] Descriptional complexity of bounded context-free languages
Malcher, Andreas
Pighizzini, Giovanni
DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2007, 4588 : 312 - +

← 1 2 3 4 5 →