19 search results - page 1 / 4 » Prediction-Preserving Reducibility with Membership Queries o... |
FCT
2001
Springer
13 years 10 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 ...
FORMATS
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. We extend Angluin’s algorithm for on-line learning of regular languages to the setting of timed systems. We consider systems that can be described by a class of determi...
TAMC
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Formal language learning models have been widely investigated in the last four decades. But it was not until recently that the model of learning from corrections was intr...
ACL
2007
13 years 7 months ago
2007
A Bloom filter (BF) is a randomised data structure for set membership queries. Its space requirements are significantly below lossless information-theoretic lower bounds but it ...
ICDCS
1995
IEEE
13 years 9 months ago
1995
IEEE
nt formal speci cations of a new abstraction, weak sets, which can be used to alleviate high latencies when retrieving data from a wide-area information system like the World Wide...