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:20230326T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20231029T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20230124T100000
DTEND;TZID=Europe/Paris:20230124T110000
DTSTAMP:20260423T194412
CREATED:20230103T133548Z
LAST-MODIFIED:20230103T133548Z
UID:11041-1674554400-1674558000@www.greyc.fr
SUMMARY:Séminaire Algorithmique : Solène Esnay (IMT\, Univ. Toulouse 3) « Arithmetical Complexity of the Language of Generic Limit Sets of Cellular Automata »
DESCRIPTION:Dynamical systems have various notions of attractor\, and they characterize different asymptotic properties. Among them is the notion of generic attractor: a closed set that attracts most of the space in the topological sense\, meaning its basin of attraction is comeager. The generic limit set is the smallest generic attractor and contained in all of them: all of the configurations in it are visited infinitely often or approached with arbitrary precision by a nonnegligible set of initial configurations. \nIn the context of (unidimensional) cellular automata\, which are well-known and simple discrete dynamical systems\, the generic limit set has an additional property: it is a subshift\, that is\, the set of all the configurations it contains can be entirely described by the alphabet of the automaton and a (possibly infinite) list of forbidden patterns that cannot appear. Cellular automata may still have complex generic limit sets in the arithmetical sense (Sigma 3 at worst)\, but some properties of the automaton (the existence of equicontinuity points) or of the generic limit set (minimality as an attractor or as a subshift\, mixing properties) can lower that complexity. \nThis presentation is a detailed study of the complexity and structure of the attractor – and so\, essentially\, of the automaton as a consequence – as they are impacted by these various properties\, in the same fashion as other articles do about other attractors (omega-limit set and mu-limit set). \nThis is a joint work with Alonso Nuñez and Ilkka Törmä.
URL:https://www.greyc.fr/event/seminaire-algorithmique-solene-esnay-imt-univ-toulouse-3-arithmetical-complexity-of-the-language-of-generic-limit-sets-of-cellular-automata/
LOCATION:Sciences 3- S3 351
CATEGORIES:General,Séminaire Algo
END:VEVENT
END:VCALENDAR