Login / Signup
Circuit Complexity of Regular Languages.
Michal Koucký
Published in:
Theory Comput. Syst. (2009)
Keyphrases
</>
training examples
regular languages
training data
decision problems
supervised learning
learning algorithm
regular expressions
context free languages
grammatical inference
worst case
finite automata
computational complexity
positive data
lower bound
semi supervised
object oriented