Types of trusted information that make DFA identification with correction queries feasible

Authors:
Cristina Tîrnăucă;Cătălin Ionuţ Tîrnăucă
Affiliations:
Departamento de Matemáticas, Estadística y Computación, Universidad de Cantabria, Santander, Spain;Universitat Rovira i Virgili, Tarragona, Spain
Venue:
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Year:
2010

Citing 9
Cited 0

Learning regular sets from queries and counterexamples

Information and Computation
Negative Results for Equivalence Queries

Machine Learning
Teaching a smarter learner

Journal of Computer and System Sciences
Regular languages

Handbook of formal languages, vol. 1
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Queries and Concept Learning

Machine Learning
Queries and Concept Learning

Machine Learning
Polynomial Time Algorithms for Learning k-Reversible Languages and Pattern Languages with Correction Queries

ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
Learning DFA from correction and equivalence queries

ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the query learning model, the problem of efficiently identifying a deterministic finite automaton (DFA) has been widely investigated. While DFAs are known to be polynomial time learnable with a combination of membership queries (MQs) and equivalence queries (EQs), each of these types of queries alone are not enough to provide sufficient information for the learner. Therefore, the possibility of having some extra-information shared between the learner and the teacher has been discussed. In this paper, the problem of efficient DFA identification with correction queries (CQs) - an extension of MQs - when additional information is provided to the learner is addressed. We show that knowing the number of states of the target DFA does not help (similar to the case of MQs or EQs), but other parameters such as the reversibility or injectivity degree are useful.