BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/77
DTSTAMP:20230914T125909Z
SUMMARY:Effective Eilenberg Machines
DESCRIPTION:Speaker: Benoit Razet\nTata Institute of Fundamental Research\n
 School of Technology and Computer Science\nHomi Bhabha Road\n\nAbstract: \
 nIn this talk I revisit the idea of Eilenberg (from the book  Automata\, L
 anguages and machines Vol.A  1974) to use automata labelled with relations
  as a general computational model. The model is now called Eilenberg machi
 nes. Originally it was presented in an abstract mathematical way. We make 
 the model more precise to make it effective and give design choices for si
 mulation using modern programming languages. In contrast with Turing machi
 nes\, it is interesting to mention that Eilenberg machines may help to sol
 ve realistic problems\, like the Sanskrit sandhi inversion problem for sen
 tence segmentation as shown by Gérard Huet. We will also discuss how th
 e simulation can be implemented in a clean way and proved correct using a 
 software of modern formal mathematics. We will also review the state of th
 e art of compilation of non-deterministic automata from regular expression
 s since the latter shall be used as a language for describing the control 
 component of Eilenberg machines.\n
URL:https://www.tcs.tifr.res.in/web/events/77
DTSTART;VALUE=DATE:20100317
LOCATION:A-212 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR