PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Types of trusted information that make DFA identification with correction queries feasible
Cristina Tirnauca and Catalin Ionut Tirnauca
In: 15th International Conference on Implementation and Application of Automata, 12-15 August 2010, Winnipeg, Canada.


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.

EPrint Type:Conference or Workshop Item (Paper)
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Theory & Algorithms
ID Code:7397
Deposited By:Cristina Tirnauca
Deposited On:17 March 2011