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:20240521T100000
DTEND;TZID=Europe/Paris:20240521T110000
DTSTAMP:20260503T101212
CREATED:20240513T082150Z
LAST-MODIFIED:20240524T150934Z
UID:11515-1716285600-1716289200@www.greyc.fr
SUMMARY:Séminaire Algorithmique : « Computability of extender sets in multidimensional subshifts »\, Léo Paviet Salomon (GREYC\, Caen)
DESCRIPTION:A classical result from the theory of formal languages\, the Myhill-Nerode theorem\, gives a necessary and sufficient condition in terms of congruence classes for a language to be regular. In this talk\, we try to adapt this result to the case of subshifts\, in which we consider potentially multidimensional infinite configurations rather than finite words. In particular\, we study the behavior of /extender entropy/\, a property introduced by R. Pavlov and T. French which is analogous to congruence classes in formal languages\, and obtain some computability characterizations on the possible extender entropies of various classes of subshifts.
URL:https://www.greyc.fr/event/seminaire-algorithmique-leo-paviet-salomon-greyc-caen/
LOCATION:Sciences 3- S3 351
CATEGORIES:Amacc,General,News,Séminaire Algo
END:VEVENT
END:VCALENDAR