Learning Erasing Pattern Languages with Queries

Authors: Jochen Nessel and Steffen Lange .

Source: Lecture Notes in Artificial Intelligence Vol. 1968, 2000, 86 - 100.

Abstract. A pattern is a finite string of constant and varibale symbols. The non-erasing language generated by a pattern is the set of all strings of constant symbols that can be obtained by substituting non-empty strings for variables. In order to built the erasing language generated by a pattern, it is also admissible to substitute the empty string.

The present paper deals with the problem of learning erasing pattern languages within Angluin's model of learning with queries. Moreover, the learnability of erasing pattern languages with queries is studied when additional information is available. The results obtained are compared with previously known results concerning the case that non-erasing pattern languages have to be learned.

©Copyright 2000 Springer