The Power of Correction Queries

1. 9th of February 2006Seminar V The Power of Correction Queries Cristina Bibire Research Group on Mathematical Linguistics, Rovira i Virgili University Pl. Imperial Tarraco 1, 43005, Tarragona, Spain E-mail: cristina.bibire@estudiants.urv.es

2. Outline • Introduction • A class which makes the difference • Practical results • The injectivity property • Future Work

3. Introduction The correcting string of s in the language L is the smallest string s' (in lex-length order) such that s.s' belongs to L. The answer to a correction query for a string consists of its correcting string. Myhill-Nerode theorem: The number of states in the smallest DFA accepting L is equal to the number of equivalence classes in .

4. Introduction Definition By the number of MQs a language require in order to be identified we understand how many different strings are submitted by the learner L* to the teacher until it outputs the target language. Note that each string is counted only once: even if the algorithm reaches a point where the learner should submit to the teacher a string which was previously submitted we will not count this as another MQ. Definition By the number of CQs a language require in order to be identified we understand how many different strings are submitted by the learner LCA to the teacher until it outputs the target language. In this case, not only we do not count twice the same string, but the learner LCA can also obtain some implicit answers. Therefore, the algorithm does not ask these questions and we do not count them as new CQs.

5. A class which makes the difference Theorem There exists an infinite class of languages which requires a polynomial number of MQs but a linear number of CQs in order to be identified.

6. A class which makes the difference Theorem There exists an infinite class of languages which requires a polynomial number of MQs but a linear number of CQs in order to be identified. Let us consider the class of singletons over .

7. A class which makes the difference Theorem There exists an infinite class of languages which requires a polynomial number of MQs but a linear number of CQs in order to be identified. Let us consider the class of singletons over . Lemma 1. For any fixed alphabet of length and any language L in , the number of MQs needed by L* in order to identify L is: where m is the size of the minimal DFA accepting L. Lemma 2. For any fixed alphabet of length and any language L in , the number of CQs needed by LCA in order to identify L is: where m is the size of the minimal DFA accepting L.

8. A class which makes the difference If n is the length of the unique string in L, then:

9. A class which makes the difference If n is the length of the unique string in L, then:

10. A class which makes the difference If n is the length of the unique string in L, then:

11. Practical Results

12. Practical Results

13. The injectivity property For any regular language L, we say that it has the injectivity property if for every two strings s and s',

14. The injectivity property For any regular language L, we say that it has the injectivity property if for every two strings s and s', Theorem Let L be a regular language. If L has the injectivity property then the number of CQs is at most meanwhile the number of MQs is at least , where k is the size of the alphabet and n the number of states of the minimal DFA accepting L.

15. The injectivity property For any regular language L, we say that it has the injectivity property if for every two strings s and s', Theorem Let L be a regular language. If L has the injectivity property then the number of CQs is at most meanwhile the number of MQs is at least , where k is the size of the alphabet and n the number of states of the minimal DFA accepting L. Proof

16. The injectivity property For any regular language L, we say that it has the injectivity property if for every two strings s and s', Theorem Let L be a regular language. If L has the injectivity property then the number of CQs is at most meanwhile the number of MQs is at least , where k is the size of the alphabet and n the number of states of the minimal DFA accepting L. Proof

17. The injectivity property E Proof S SΣ-S

18. The injectivity property E Proof S SΣ-S

19. The injectivity property E Proof S SΣ-S

20. The injectivity property E Proof S SΣ-S

21. Future Work • The injectivity property: • Find a proper upper bound for the number of MQs (polynomial?) • Find a mathematical relation between the degree of injectivity and the reducing factor (MQ/CQ) • Other classes of languages: • Classes of languages learnable from positive examples (finite thickness, finite elasticity, characteristic sample) or not (finite tell tale) • The class of k-reversible languages • Others ?

22. Thank You!