BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//7.2.3.1//EN
BEGIN:VEVENT
UID:753@lincs.fr
DTSTART;TZID=Europe/Paris:20230329T150000
DTEND;TZID=Europe/Paris:20230329T160000
DTSTAMP:20230407T092406Z
URL:https://www.lincs.fr/events/fast-how-to-find-relevant-regular-expressi
 on-from-a-small-set-of-positive-examples/
SUMMARY:fAST: How to find relevant regular expression from a small set of
 positive examples
DESCRIPTION:Regular expressions are ubiquitous in computer science but are
 cumbersome to code. In this work\, we present a new algorithm\, named fAST
 (find Abstract Syntax Tree)\, that infers a regular expression from a small
 set of positive examples. Its main strength (with respect to the start of
 the art) resides in its ability to perform this inference without counter
 examples.\n\nAuthors: Maxime Raynal (LIG\, NBLF)\, Marc-Olivier Buob
 (NBLF)\, Georges Quénot (LIG)
CATEGORIES:Seminars,Youtube
LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\,
 Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Paris
X-LIC-LOCATION:Europe/Paris
BEGIN:DAYLIGHT
DTSTART:20230326T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
END:DAYLIGHT
END:VTIMEZONE
END:VCALENDAR