Digraph complexity measures and applications in formal language theory

被引：0

作者：

机构：

[1] [1,Gruber, Hermann

来源：

Gruber, H. (info@hermann-gruber.com) | 1600年 / Discrete Mathematics and Theoretical Computer Science卷 / 14期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

共 50 条

[1] Complexity and structure in formal language theory
Lange, K.-J.
Fundamenta Informaticae, 1996, 25 (3-4)
[2] APPLICATIONS OF SCHEDULING THEORY TO FORMAL LANGUAGE THEORY
GONCZAROWSKI, J
WARMUTH, MK
THEORETICAL COMPUTER SCIENCE, 1985, 37 (02) : 217 - 243
[3] Security Applications of Formal Language Theory
Sassaman, Len
Patterson, Meredith L.
Bratus, Sergey
Locasto, Michael E.
IEEE SYSTEMS JOURNAL, 2013, 7 (03): : 489 - 500
[4] On the algorithmic effectiveness of digraph decompositions and complexity measures
Lampis, Michael
Kaouri, Georgia
Mitsou, Valia
DISCRETE OPTIMIZATION, 2011, 8 (01) : 129 - 138
[5] On the Algorithmic Effectiveness of Digraph Decompositions and Complexity Measures
Lampis, Michael
Kaouri, Georgia
Mitsou, Valia
ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2008, 5369 : 220 - +
[6] New approach to formal language theory by Kolmogorov complexity
Univ of Waterloo, Waterloo, Canada
SIAM J Comput, 2 (398-410):
[7] A NEW APPROACH TO FORMAL LANGUAGE THEORY BY KOLMOGOROV COMPLEXITY
LI, M
VITANYI, PMB
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 372 : 506 - 520
[8] A NEW APPROACH TO FORMAL LANGUAGE THEORY BY KOLMOGOROV COMPLEXITY
LI, M
VITANYI, P
SIAM JOURNAL ON COMPUTING, 1995, 24 (02) : 398 - 410
[9] Complexity theory made easy - The formal language approach to the definition of complexity classes
Vollmer, H
DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2003, 2710 : 95 - 110
[10] COMPLEXITY THEORY AND FORMAL LANGUAGES
LANGE, KJ
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 381 : 19 - 36

← 1 2 3 4 5 →