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:20210328T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20211031T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20210629T100000
DTEND;TZID=Europe/Paris:20210629T110000
DTSTAMP:20260504T211744
CREATED:20210628T075049Z
LAST-MODIFIED:20210628T075049Z
UID:10516-1624960800-1624964400@www.greyc.fr
SUMMARY:Séminaire ALGO\, Florian Bridoux (LIS\, Université Aix-Marseille) : "Réseaux d'automates expansifs"
DESCRIPTION:Résumé : \nAn Automata Network is a map f:Qn→Qn where Q is a finite alphabet. It  can be viewed as a network of n entities\, each holding a state from Q\, and evolving according to a deterministic synchronous update rule in such a way that each entity only depends on its neighbors in the network’s graph\, called interaction graph. A major trend in automata network theory is to understand how the interaction graph affects dynamical properties of f. \nIn this work we introduce the following property called expansivity: the observation of the sequence of states at any given node is sufficient to determine the initial configuration of the whole network. Our main result is a characterization of interaction graphs that allow expansivity. Moreover\, we show that this property is generic among linear automata networks over such graphs with large enough alphabet. We show however that the situation is more complex when the alphabet is fixed independently of the size of the interaction graph: no alphabet is sufficient to obtain expansivity on all admissible graphs\, and only non-linear solutions exist in some cases. Finally\, among other results\, we consider a stronger version of expansivity where we ask to determine the initial configuration from any large enough observation of the system. We show that it can be achieved for any number of nodes and naturally gives rise to maximum distance separable codes.
URL:https://www.greyc.fr/event/seminaire-algo-florian-bridoux-lis-universite-aix-marseille-reseaux-dautomates-expansifs/
LOCATION:Sciences 3- S3 351
CATEGORIES:Amacc,Séminaire Algo
END:VEVENT
END:VCALENDAR