Types of Trusted Information That Make DFA Identification with Correction Queries Feasible
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.
Keywordsdeterministic finite automaton correction query injectivity degree
Unable to display preview. Download preview PDF.
- 3.Angluin, D.: Learning k-bounded context-free grammars. Technical Report TR-557, Yale University, New Haven, Conn. (1987)Google Scholar
- 4.Angluin, D.: Learning k-term DNF formulas using queries and counter-examples. Technical Report TR-559, Yale University, New Haven, Conn. (1987)Google Scholar
- 7.Angluin, D.: Negative results for equivalence queries. Machine Learning 5(2), 121–150 (1990)Google Scholar
- 13.Tîrnăucă, C.: Language Learning with Correction Queries. Ph.D. thesis, Universitat Rovira i Virgili, Tarragona, Spain (2009)Google Scholar
- 14.Tîrnăucă, C., Knuutila, T.: Efficient language learning with correction queries. Technical Report 822, Turku Center for Computer Science (2007)Google Scholar
- 15.Tîrnăucă, C., Knuutila, T.: Polynomial time algorithms for learning k-reversible languages and pattern languages with correction queries. In: Hutter, M., Servedio, R.A., Takimoto, E. (eds.) ALT 2007. LNCS (LNAI), vol. 4754, pp. 264–276. Springer, Heidelberg (2007)Google Scholar