e/Curtis-Hedlund-Lyndon theorem

Information
has gloss	eng: In mathematics, the Curtis–Hedlund–Lyndon theorem, also called Hedlund's theorem, after Gustav A. Hedlund, characterizes the global mappings of cellular automata as the mappings which are continuous (with respect to Cantor topology) and translation-invariant. More generally, it asserts that the morphisms between two shift spaces (i.e., continuous mappings that commute with the shift) are exactly those mappings which can be defined uniformly by a local rule.
lexicalization	eng: Curtis-Hedlund-Lyndon theorem
lexicalization	eng: Curtis–Hedlund–Lyndon theorem
instance of	e/Cellular automaton