Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
|
 |
Learning Erasing Pattern Languages with Queries
| |
|
Learning Erasing Pattern Languages with Queries
Jochen Nessel4  and Steffen Lange5
| (4) |
Universität Kaiserslautern, Fachbereich Informatik, Postfach 3049, 67653 Kaiserslautern, Germany |
| (5) |
Universität Leipzig, Institut für Informatik, Augustusplatz 10-11, 04109 Leipzig, Germany |
Abstract
A pattern is a finite string of constant and variable 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 build
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.
Fulltext Preview (Small, Large)
 References secured to subscribers.
|
|
|
|
|
|