We're sorry but this page doesn't work properly without JavaScript enabled. Please enable it to continue.
Feedback

Cellular automata and finite groups

4
 Cite
 Share
 Related Material
 Download
 Purchase
No logo availableBanff International Research Station (BIRS) for Mathematical Innovation and Discovery
 Castillo-Ramirez, Alonso

Formal Metadata

Title
Cellular automata and finite groups
Title of Series
Number of Parts
12
Author
License
CC Attribution - NonCommercial - NoDerivatives 4.0 International:
You are free to use, copy, distribute and transmit the work or content in unchanged form for any legal and non-commercial purpose as long as the work is attributed to the author in the manner specified by the author or licensor.
Identifiers
Publisher
Release Date
Language

Content Metadata

Subject Area
Genre
Abstract
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.