论文信息 - Complexity of Automaton Identification from Given Data - 字舞流文

Complexity of Automaton Identification from Given Data

E. Mark Gold | E. M. Gold | E. Gold

[1] Richard M. Karp,et al. On the Computational Complexity of Combinatorial Problems , 1975, Networks.

[2] M. Arbib,et al. MACHINES IN A CATEGORY: AN EXPOSITORY INTRODUCTION* , 1974 .

[3] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[4] E. Mark Gold,et al. System identification via state characterization , 1972 .

[5] Jerome A. Feldman,et al. On the Synthesis of Finite-State Machines from Samples of Their Behavior , 1972, IEEE Transactions on Computers.

[6] M. A. ARBIB,et al. On the relevance of abstract algebra to control theory , 1969, Autom..

[7] H. Paul Zeiger,et al. Ho's Algorithm, Commutative Diagrams, and the Uniqueness of Minimal Linear Systems , 1967, Inf. Control..

[8] E. Mark Gold,et al. Language Identification in the Limit , 1967, Inf. Control..

[9] A. Nerode,et al. Linear automaton transformations , 1958 .