A Polynomial Time Learning Algorithm of Simple Deterministic Languages via Membership Queries and a Representative Sample

Abstract

We show that a simple deterministic language is learnable via membership queries in polynomial time if the learner knows a special finite set of positive examples which is called a representative sample. Angluin(1981) showed that a regular language is learnable in polynomial time with membership queries and a representative sample. Thus our result is an extension of her work.