A note on the query complexity of learning DFA
- 1 January 1993
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Inductive inference, DFAs, and computational complexityPublished by Springer Nature ,1989
- Reductions among prediction problems: on the difficulty of predicting automataPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- Learning regular sets from queries and counterexamplesInformation and Computation, 1987
- A theory of the learnableCommunications of the ACM, 1984