BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1590
DTSTAMP:20250717T055431Z
SUMMARY:Approximate Problems for Finite Transducers
DESCRIPTION:Speaker: Saina Sunny (IIT Goa)\n\nAbstract: \nFinite (word) sta
 te transducers extend finite state automata by defining a binary relation 
 over finite words\, called rational relation. If the rational relation is 
 the graph of a function\, this function is said to be rational. The class 
 of sequential functions is a strict subclass of rational functions\, defin
 ed as the functions recognised by input-deterministic finite state transdu
 cers. The class membership problems between those classes are known to be 
 decidable. In this talk\, I present approximate versions of these problems
  and show they are decidable as well. This includes the approximate functi
 onality problem\, which asks whether given a rational relation (by a trans
 ducer)\, is it close to a rational function\, and the approximate determin
 isation problem\, which asks whether a given rational function is close to
  a sequential function. Closeness is measured using a notion of distance b
 etween functions or relations.\n
URL:https://www.tcs.tifr.res.in/web/events/1590
DTSTART;TZID=Asia/Kolkata:20250718T160000
DTEND;TZID=Asia/Kolkata:20250718T170000
LOCATION:A-201 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR
