2474 search results - page 1 / 495 » Learning Languages in a Union |
ALT
2001
Springer
13 years 12 months ago
2001
Springer
IEICET
2008
13 years 7 months ago
2008
We consider the polynomial time learnability of finite unions of ordered tree patterns with internal structured variables, in the query learning model of Angluin (1988). An ordered...
ALT
1995
Springer
13 years 11 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...
FCT
2001
Springer
13 years 12 months ago
2001
Springer
This paper presents the prediction-preserving reducibility with membership queries (pwm-reducibility) on formal languages, in particular, simple CFGs and finite unions of regular ...
EUROCOLT
1997
Springer
13 years 11 months ago
1997
Springer
The approach of ordinal mind change complexity, introduced by Freivalds and Smith, uses (notations for) constructive ordinals to bound the number of mind changes made by a learnin...