Login / Signup
New bounds for the query complexity of an algorithm that learns DFAs with correction and equivalence queries.
Victor Mitrana
Cristina Tîrnauca
Published in:
Acta Informatica (2011)
Keyphrases
</>
query complexity
equivalence queries
worst case
membership queries
learning algorithm
np hard
theoretical analysis
computational complexity
efficient learning
lower and upper bounds
upper and lower bounds
optimal solution
upper bound
classification algorithm
data complexity
exact learning
machine learning