BIRS Workshop Lecture Videos

Banff International Research Station Logo

BIRS Workshop Lecture Videos

Cellular automata and finite groups. Castillo-Ramirez, Alonso


Let G be a finite group and A a finite set. A cellular automaton is a transformation of the configuration space A^G that commutes with the natural action of G. We shall present some algebraic results on the monoid of cellular automata over A^G, and discuss some of the difficulties of extending these to a more general setting.

Item Media

Item Citations and Data


Attribution-NonCommercial-NoDerivatives 4.0 International