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:20241022T104500
DTEND;TZID=Europe/Paris:20241022T114500
DTSTAMP:20260503T050131
CREATED:20241003T131040Z
LAST-MODIFIED:20241018T134400Z
UID:11662-1729593900-1729597500@www.greyc.fr
SUMMARY:Séminaire Algorithmique : « Random Deterministic Automata With One Added Transition »\, Cyril Nicaud (LIGM\, Univ. Paris-Est)
DESCRIPTION:Every language recognized by a non-deterministic finite automaton can be recognized by a deterministic automaton\, at the cost of a potential increase of the number of states\, which in the worst case can go from n to 2^n. In this talk\, we investigate this classical result in a probabilistic setting where we take a random deterministic automaton with n states and add just one random transition. \nThis is join work with Arnaud Carayol\, Philippe Duchon and Florent Koechlin.
URL:https://www.greyc.fr/event/seminaire-algorithmique-titre-a-venir-cyril-nicaud-ligm-univ-paris-est/
LOCATION:Sciences 3- S3 351
CATEGORIES:General,News,Séminaire Algo
END:VEVENT
END:VCALENDAR