FINITE AUTOMATA AND COMPUTATIONAL-COMPLEXITY

被引：0

|

作者：

STRAUBING, H ^{[1
]}

THERIEN, D ^{[1
]}

机构：

[1] MCGILL UNIV, SCH COMP SCI, MONTREAL H3A 2A7, QUEBEC, CANADA

来源：

LECTURE NOTES IN COMPUTER SCIENCE | 1989年 / 386卷

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

收藏

页码：199 / 233

页数：35

相关论文

共 50 条

[1] FINITE AUTOMATA AND COMPUTATIONAL-COMPLEXITY
STRAUBING, H
THERIEN, D
FORMAL PROPERTIES OF FINITE AUTOMATA AND APPLICATIONS, 1989, 386 : 199 - 233
[2] ON THE COMPUTATIONAL-COMPLEXITY OF FINITE CELLULAR-AUTOMATA
SUTNER, K
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1995, 50 (01) : 87 - 97
[3] THE COMPUTATIONAL-COMPLEXITY OF CELLULAR AUTOMATA
SUTNER, K
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 380 : 451 - 459
[4] CHARACTERIZATIONS AND COMPUTATIONAL-COMPLEXITY OF SYSTOLIC TRELLIS AUTOMATA
IBARRA, OH
KIM, SM
THEORETICAL COMPUTER SCIENCE, 1984, 29 (1-2) : 123 - 153
[5] COMPUTATIONAL-COMPLEXITY AND HARDEST LANGUAGES OF AUTOMATA WITH ABSTRACT STORAGES
DASSOW, J
LANGE, KJ
LECTURE NOTES IN COMPUTER SCIENCE, 1991, 529 : 200 - 209
[6] ON THE COMPUTATIONAL-COMPLEXITY OF APPROXIMATING DISTRIBUTIONS BY PROBABILISTIC-AUTOMATA
ABE, N
WARMUTH, MK
MACHINE LEARNING, 1992, 9 (2-3) : 205 - 260
[7] Descriptional and Computational Complexity of Finite Automata
Holzer, Markus
Kutrib, Martin
LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, 2009, 5457 : 23 - 42
[8] AN OVERVIEW OF COMPUTATIONAL-COMPLEXITY
COOK, SA
COMMUNICATIONS OF THE ACM, 1983, 26 (06) : 401 - 408
[9] AMORTIZED COMPUTATIONAL-COMPLEXITY
TARJAN, RE
SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1985, 6 (02): : 306 - 318
[10] THE COMPUTATIONAL-COMPLEXITY OF ABDUCTION
BYLANDER, T
ALLEMANG, D
TANNER, MC
JOSEPHSON, JR
ARTIFICIAL INTELLIGENCE, 1991, 49 (1-3) : 25 - 60

← 1 2 3 4 5 →