80 search results - page 2 / 16 » On the Learnability of Erasing Pattern Languages in the Quer... |
COLT
1999
Springer
13 years 9 months ago
1999
Springer
This paper proposes the use of constructive ordinals as mistake bounds in the on-line learning model. This approach elegantly generalizes the applicability of the on-line mistake ...
ALT
1995
Springer
13 years 8 months ago
1995
Springer
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...
ALT
1997
Springer
13 years 8 months ago
1997
Springer
A pattern is a string of constant and variable symbols. The language generated by a pattern is the set of all strings of constant symbols which can be obtained from by substituti...
JALC
2007
13 years 4 months ago
2007
Inspired by the results obtained in the string case, we present in this paper the extension of the correction queries to regular tree languages. Relying on Angluin’s and Sakakib...
CIE
2011
Springer
12 years 4 months ago
2011
Springer
Automatic classes are classes of languages for which a finite automaton can decide whether a given element is in a set given by its index. The present work studies the learnabilit...