A PAC learnability of simple deterministic languages

Abstract

We show a polynomial time PAC learnability of simple deterministic languages with new defined queries and samples. In this paper, we define a new query called hashed membership query. This query takes a 3-tuple of words. Then it replies with the membership of the word which is the concatenation of these three words in addition whether the 3-tuple represents a nonterminal or not in the target grammar. With this query, the polynomial time PAC learnability is shown by the same analysis in [2] on the new suggested algorithm in this paper.