Learning regular sets from queries and counterexamples
- 1 November 1987
- journal article
- Published by Elsevier in Information and Computation
- Vol. 75 (2) , 87-106
- https://doi.org/10.1016/0890-5401(87)90052-6
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- A theory of the learnableCommunications of the ACM, 1984
- Inductive Inference: Theory and MethodsACM Computing Surveys, 1983
- A note on the number of queries needed to identify regular languagesInformation and Control, 1981
- Complexity of automaton identification from given dataInformation and Control, 1978
- System identification via state characterizationAutomatica, 1972