The Curtis–Hedlund–Lyndon theorem is a mathematical characterization of cellular automata in terms of their symbolic dynamics. It is named after Morton...

as the De Bruijn–Erdős theorem stating that every minimal k-chromatic graph is finite, and the Curtis–Hedlund–Lyndon theorem providing a topological...

known for Lyndon words, the Curtis–Hedlund–Lyndon theorem, Craig–Lyndon interpolation and the Lyndon–Hochschild–Serre spectral sequence. Lyndon was born...

and Curtis formulated the conjecture in a 1965 paper; it remains open. Together with Gustav A. Hedlund and Roger Lyndon, he proved the Curtis–Hedlund–Lyndon...

crystallography) Curtis–Hedlund–Lyndon theorem (cellular automata) Cut-elimination theorem (proof theory) Dandelin's theorem (solid geometry) Danskin's theorem (convex...

The most fundamental result is the characterization in the Curtis–Hedlund–Lyndon theorem of the set of global rules of cellular automata as the set of...

between representations which commutes with the action of G. Curtis–Hedlund–Lyndon theorem, a characterization of cellular automata in terms of equivariant...

Hedlund, and to topological dynamics. The Curtis–Hedlund–Lyndon theorem, a topological characterization of cellular automata, is named after Hedlund....

a cellular automaton rule. The proof of this fact uses the Curtis–Hedlund–Lyndon theorem, a topological characterization of cellular automata rules as...

function and then shifting the cells. For such functions, the Curtis–Hedlund–Lyndon theorem ensures that the value of the transition function at each group...