BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//GREYC UMR CNRS 6072 - Groupe de Recherche en Informatique, Image, et Instrumentation de Caen - ECPv5.7.0//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:GREYC UMR CNRS 6072 - Groupe de Recherche en Informatique, Image, et Instrumentation de Caen
X-ORIGINAL-URL:https://www.greyc.fr
X-WR-CALDESC:évènements pour GREYC UMR CNRS 6072 - Groupe de Recherche en Informatique, Image, et Instrumentation de Caen
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20240331T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20241027T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20240514T100000
DTEND;TZID=Europe/Paris:20240514T110000
DTSTAMP:20260503T101256
CREATED:20240513T082027Z
LAST-MODIFIED:20241003T140141Z
UID:11513-1715680800-1715684400@www.greyc.fr
SUMMARY:Séminaire Algorithmique « History-deterministic and explorable automata »\, Denis Kuperberg (LIP\, ENS Lyon)
DESCRIPTION:History-deterministic automata are intermediary between deterministic and nondeterministic ones\, and have been the object of thorough study in the last decade. They offer a way to get a better grasp of the power of nondeterminism\, by allowing only some aspects of it: nondeterministic choices are allowed to depend on the past of the computation but not on the future. I will present the state of the art on the understanding of these history-deterministic automata\, as well as open problems related to complexity questions. If time permits\, I will finish by presenting a recent generalization of history-determinism called explorable automata\, where more nondeterminism is allowed\, and some intriguing decidability questions remain open.
URL:https://www.greyc.fr/event/seminaire-algorithmique-synthesis-for-fragments-of-first-order-logic-on-data-words-denis-kuperberg-lip-ens-lyon/
LOCATION:Sciences 3- S3 351
CATEGORIES:Amacc,General,News,Séminaire Algo
END:VEVENT
END:VCALENDAR