BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/7
DTSTAMP:20230914T125906Z
SUMMARY:Solving Conjugacy Equation on Languages
DESCRIPTION:Speaker: Benny George K.\nSchool of Technology and Computer Sci
 ence\nTata Institute of Fundamental Research\nHomi Bhabha Road\n\nAbstract
 : \nXZ=ZY is called the conjugacy equation. Given languages X and Y we are
  interested in knowing if there exists a non empty language Z which makes 
 this equation true. This problem is undecidable in the general setting. We
  first look at X  being a two element set and Y  a three element set and o
 btain some characterizations for X and Y to be conjugates. We then extend 
 some of those results to the case when Y is a finite set.\n
URL:https://www.tcs.tifr.res.in/web/events/7
DTSTART;VALUE=DATE:20090619
LOCATION:A-212 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR