BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//7.2.3.1//EN
BEGIN:VEVENT
UID:465@lincs.fr
DTSTART;TZID=Europe/Paris:20190617T103000
DTEND;TZID=Europe/Paris:20190617T120000
DTSTAMP:20190612T083944Z
URL:https://www.lincs.fr/events/learning-regular-sets-from-queries-and-cou
 nterexamples/
SUMMARY:Learning regular sets from queries and counterexamples
DESCRIPTION:\nThe problem of identifying an unknown regular set from
 examples of its members and nonmembers is addressed. It is assumed that the
 regular set is presented by a minimally adequate Teacher\, which can answer
 membership queries about the set and can also test a conjecture and
 indicate whether it is equal to the unknown set and provide a
 counterexample if not. (A counterexample is a string in the symmetric
 difference of the correct set and the conjectured set.) A learning
 algorithm L* is described that correctly learns any regular set from any
 minimally adequate Teacher in time polynomial in the number of states of
 the minimum dfa for the set and the maximum length of any counterexample
 provided by the Teacher. It is shown that in a stochastic setting the
 ability of the Teacher to test conjectures may be replaced by a random
 sampling oracle\, EX( ). A polynomial-time learning algorithm is shown for
 a particular problem of context-free language
 identification.\n\n\n\nReference: Learning regular sets from queries and
 counterexamples (Dana Angluin\,  1987)\n\n\n\n  \n
CATEGORIES:Network Theory,Working Group
LOCATION:Telecom Paristech\, I304 (3rd floor)\, 23\, avenue d'Italie\,
 Paris\, 75013\, France
GEO:48.8283983;2.3568972000000485
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\,
 Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Telecom Paristech\, I304
 (3rd floor):geo:48.8283983,2.3568972000000485
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Paris
X-LIC-LOCATION:Europe/Paris
BEGIN:DAYLIGHT
DTSTART:20190331T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
END:DAYLIGHT
END:VTIMEZONE
END:VCALENDAR