BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1240
DTSTAMP:20230914T125956Z
SUMMARY:The L* Algorihthm for Constructing Deterministic Finite Automatons
DESCRIPTION:Speaker: Malhar Ajit  Managoli\n\nAbstract: \nSuppose we are pr
 esented with a language like L = {x ∈ {0\, 1}| The third to last bit is 
 1}. We can intuitively understand this language. Given a string we can qui
 ckly tell if it is in L or not. Coming up with a DFA for a language from s
 cratch is somewhat more difficult.\n\nThe L* algorithm is one way of writi
 ng a formal method which we use in finding a DFA for a regular language. I
 n this talk we will see a description of the L* Algorithm and a proof of c
 orrectness.\n
URL:https://www.tcs.tifr.res.in/web/events/1240
DTSTART;TZID=Asia/Kolkata:20220916T160000
DTEND;TZID=Asia/Kolkata:20220916T170000
LOCATION:A201
END:VEVENT
END:VCALENDAR