Title	Cellular automata and finite groups.
Creator	Castillo-Ramirez, Alonso
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2017-08-23T11:33
Description	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.
Extent	26 minutes
Subject	Mathematics; Convex and discrete geometry; Group theory and generalizations; Discrete mathematics
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: Universidad de Guadalajara
Series	BIRS Workshop Lecture Videos (Oaxaca de Juárez (Mexico))
Date Available	2018-03-23
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0364422
URI	http://hdl.handle.net/2429/64892
Affiliation	Non UBC
Peer Review Status	Unreviewed
Scholarly Level	Faculty
Rights URI	http://creativecommons.org/licenses/by-nc-nd/4.0/
Aggregated Source Repository	DSpace

Open Collections

BIRS Workshop Lecture Videos