BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//labri.fr//NONSGML kigkonsult.se iCalcreator 2.41.92//
CALSCALE:GREGORIAN
METHOD:PUBLISH
UID:8bde91ac-e757-40a3-a356-d7744bb5cbdc
X-WR-CALNAME:[MTV] B Srivathsan (CMI) - Deterministic Suffix-reading Automa
 ta
X-WR-TIMEZONE:Europe/Paris
BEGIN:VTIMEZONE
TZID:Europe/Paris
TZUNTIL:20251026T010000Z
BEGIN:STANDARD
TZNAME:CET
DTSTART:20231029T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RDATE:20241027T030000
END:STANDARD
BEGIN:DAYLIGHT
TZNAME:CEST
DTSTART:20230326T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RDATE:20240331T020000
RDATE:20250330T020000
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:8bde91ac-e757-40a3-a356-d7744bb5cbdc
DTSTAMP:20260425T200854Z
CLASS:PUBLIC
DESCRIPTION:We present deterministic suffix-reading automata (DSA)\, a new 
 automaton model over finite words. Our motivation for this model comes fro
 m specifications which can be described using rules of the form: 'when a c
 ertain sequence of inputs is seen\, perform this action'. DSAs provide a c
 leaner representation\, compared to deterministic finite automata (DFA)\, 
 in such situations.\n\nTransitions of a DSA are labeled with words. From a
  state\, a DSA triggers an outgoing transition when a word ending with the
  transition-label is seen. Therefore\, rather than moving along an input w
 ord letter by letter\, a DSA can jump along blocks of letters\, with each 
 block ending in a suitable suffix. This feature allows DSAs to recognize r
 egular languages more concisely.  \n\nIn the talk\, we will describe a pro
 cedure to construct a minimal DSA for a regular language\, starting from i
 ts minimal DFA.\n\nJoint work with R Keerthan\, R Venkatesh and Sagar Verm
 a.
DTSTART;TZID=Europe/Paris:20240118T130000
DTEND;TZID=Europe/Paris:20240118T140000
LOCATION:salle 178\, zoom: https://bordeaux-inp-fr.zoom.us/j/89508306159
SEQUENCE:0
SUMMARY:[MTV] B Srivathsan (CMI) - Deterministic Suffix-reading Automata
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR
