Complexity of automaton identification from given data

Information and Control - Tập 37 - Trang 302-320 - 1978
E Mark Gold1
1Département d'Informatique, Université de Montréal, Montréal, Canada

Tài liệu tham khảo

Aho, 1974 Arbib, 1974, Machines in a category, SIAM Review, 16, 163, 10.1137/1016026 Arbib, 1969, On the relevance of abstract algebra to control theory, Automatica, 5, 539, 10.1016/0005-1098(69)90026-0 Bierman, 1972, On the synthesis of finite-state machines from samples of their behavior, IEEE Trans. Computers, C-21, 592, 10.1109/TC.1972.5009015 Gold, 1967, Language identification in the limit, Inform. Contr., 10, 447, 10.1016/S0019-9958(67)91165-5 Gold, 1972, System identification via state characterization, Automatica, 8, 621, 10.1016/0005-1098(72)90033-7 Karp, 1975, On the computational complexity of combinatorial problems, Networks, 5, 45, 10.1002/net.1975.5.1.45 Nerode, 1958, Linear automaton transformations, 9, 541 Zeiger, 1967, Ho's algorithm, commutative diagrams and the uniqueness of minimal linear systems, Inform. Control, 11, 71, 10.1016/S0019-9958(67)90385-3