COMPLEXITY OF AUTOMATON IDENTIFICATION FROM GIVEN DATA

被引：429

作者：

GOLD, EM ^{[1
]}

机构：

[1] UNIV MONTREAL,DEPT INFORMAT,MONTREAL 101,QUEBEC,CANADA

来源：

INFORMATION AND CONTROL | 1978年 / 37卷 / 03期

关键词：

D O I：

10.1016/S0019-9958(78)90562-4

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：302 / 320

页数：19

共 8 条

[1] Aho A. V., 1974, DESIGN ANAL COMPUTER
[2] MACHINES IN A CATEGORY - EXPOSITORY INTRODUCTION
ARBIB, MA
MANES, EG
[J]. SIAM REVIEW, 1974, 16 (02) : 163 - 192
[3] ARBIB MA, 1969, AUTOMATICA, V5, P539
[4] SYNTHESIS OF FINITE-STATE MACHINES FROM SAMPLES OF THEIR BEHAVIOR
BIERMANN, AW
FELDMAN, JA
[J]. IEEE TRANSACTIONS ON COMPUTERS, 1972, C 21 (06) : 592 - &
[5] SYSTEM IDENTIFICATION VIA STATE CHARACTERIZATION
GOLD, EM
[J]. AUTOMATICA, 1972, 8 (05) : 621 - +
[6] LANGUAGE IDENTIFICATION IN LIMIT
GOLD, EM
[J]. INFORMATION AND CONTROL, 1967, 10 (05): : 447 - &
[7] Nerode A., 1958, P AM MATH SOC, V9, P541, DOI DOI 10.1090/S0002-9939-1958-0135681-9
[8] HOS ALGORITHM COMMUTATIVE DIAGRAMS AND UNIQUENESS OF MINIMAL LINEAR SYSTEMS
ZEIGER, P
[J]. INFORMATION AND CONTROL, 1967, 11 (1-2): : 71 - &