Cellular Automata and Kan Extensions

@article{Fernandez2021CellularAA,
  title={Cellular Automata and Kan Extensions},
  author={Alexandre Fernandez and Luidnel Maignan and Antoine Spicher},
  journal={ArXiv},
  year={2021},
  volume={abs/2102.12156}
}
In this paper, we formalize precisely the sense in which the application of a cellular automaton to partial configurations is a natural extension of its local transition function through the categorical notion of Kan extension. In fact, the two possible ways to do such an extension and the ingredients involved in their definition are related through Kan extensions in many ways. These relations provide additional links between computer science and category theory, and also give a new point of… Expand
Accretive Computation of Global Transformations of Graphs

References

SHOWING 1-7 OF 7 REFERENCES
Global Graph Transformations
Cellular Automata and Groups
Categories for the Working Mathematician. Graduate Texts in Mathematics
  • 2013
Cellular Automata and Groups, pages 778–791
  • 2009
Endomorphisms and automorphisms of the shift dynamical system
  • G. A. Hedlund
  • Mathematics, Computer Science
  • Mathematical systems theory
  • 2005