Complexity of automaton identification from given data
- 1 June 1978
- journal article
- Published by Elsevier in Information and Control
- Vol. 37 (3), 302-320
- https://doi.org/10.1016/s0019-9958(78)90562-4
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- On the Computational Complexity of Combinatorial ProblemsNetworks, 1975
- Machines in a Category: An Expository IntroductionSIAM Review, 1974
- System identification via state characterizationAutomatica, 1972
- On the Synthesis of Finite-State Machines from Samples of Their BehaviorIEEE Transactions on Computers, 1972
- On the relevance of abstract algebra to control theoryAutomatica, 1969
- Ho's algorithm, commutative diagrams, and the uniqueness of minimal linear systemsInformation and Control, 1967
- Language identification in the limitInformation and Control, 1967