BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//labri.fr//NONSGML kigkonsult.se iCalcreator 2.41.92//
CALSCALE:GREGORIAN
METHOD:PUBLISH
UID:7e94214b-dc74-44aa-b5c3-363685faadd3
X-WR-CALNAME:[M2F] Marc Zeitoun - Nested temporal hierarchies of regular la
 nguages
X-WR-TIMEZONE:Europe/Paris
BEGIN:VTIMEZONE
TZID:Europe/Paris
TZUNTIL:20260329T010000Z
BEGIN:STANDARD
TZNAME:CET
DTSTART:20231029T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RDATE:20241027T030000
RDATE:20251026T030000
END:STANDARD
BEGIN:DAYLIGHT
TZNAME:CEST
DTSTART:20240331T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RDATE:20250330T020000
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:7e94214b-dc74-44aa-b5c3-363685faadd3
DTSTAMP:20260531T015639Z
CLASS:PUBLIC
DESCRIPTION:In this talk\, we focus on unary temporal logic over words (UTL
 ). It is known that languages definable in this logic have several equival
 ent characterizations based on different formalisms. Additionally\, it is 
 known that one can decide whether a regular language can be expressed in U
 TL.\n\nFirst\, I will present these various characterizations. Then\, I wi
 ll introduce a general approach that encompasses all known results and all
 ows us to obtain new ones. This approach relies on the use of an 'operator
 ' whose repeated application yields a hierarchy of classes of regular lang
 uages. Finally\, I will present some results about this new hierarchy\, in
  particular its relationship with the so-called concatenation hierarchy. T
 his is joint work with Thomas Place.
DTSTART;TZID=Europe/Paris:20240618T140000
DTEND;TZID=Europe/Paris:20240618T150000
LOCATION:LaBRI
SEQUENCE:0
SUMMARY:[M2F] Marc Zeitoun - Nested temporal hierarchies of regular languag
 es
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR
