Linear cellular automata

0Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A cellular automaton (Γ, D0, E, f0) is called “linear” if the set E of elementary states is a ring, and the global function f is a morphism on the product space of this structure.

Cite

CITATION STYLE

APA

Hadeler, K. P., & Müller, J. (2017). Linear cellular automata. In Springer Monographs in Mathematics (pp. 287–334). Springer Verlag. https://doi.org/10.1007/978-3-319-53043-7_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free