The VC-dimensions of finite automata with n states
- 1 January 1993
- book chapter
- Published by Springer Nature
- p. 328-341
- https://doi.org/10.1007/3-540-57370-4_58
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- On the complexity of learning from counterexamples and membership queriesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A note on the query complexity of learning DFAPublished by Springer Nature ,1993
- Learning commutative deterministic finite state automata in polynomial timeNew Generation Computing, 1991
- A maxmin problem on finite automataDiscrete Applied Mathematics, 1989
- On the complexity of learning from counterexamplesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Nonuniform learnabilityPublished by Springer Nature ,1988
- Learning regular sets from queries and counterexamplesInformation and Computation, 1987
- Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimensionPublished by Association for Computing Machinery (ACM) ,1986