COMPLEXITY OF AUTOMATON IDENTIFICATION FROM GIVEN DATA

被引:436
作者
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 [J].
ARBIB, MA ;
MANES, EG .
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 [J].
BIERMANN, AW ;
FELDMAN, JA .
IEEE TRANSACTIONS ON COMPUTERS, 1972, C 21 (06) :592-&
[5]   SYSTEM IDENTIFICATION VIA STATE CHARACTERIZATION [J].
GOLD, EM .
AUTOMATICA, 1972, 8 (05) :621-+
[6]   LANGUAGE IDENTIFICATION IN LIMIT [J].
GOLD, EM .
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 [J].
ZEIGER, P .
INFORMATION AND CONTROL, 1967, 11 (1-2) :71-&