Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Clyde James Felix"'
Publikováno v:
Annals of Mathematics and Artificial Intelligence. 90:93-105
Let $NFA_b(q)$ denote the set of languages accepted by nondeterministic finite automata with $q$ states over an alphabet with $b$ letters. Let $B_n$ denote the set of words of length $n$. We give a quadratic lower bound on the VC dimension of \[ NFA_
Publikováno v:
2022 International Joint Conference on Neural Networks (IJCNN).