Skip to search formSkip to main contentSkip to account menu

Curtis–Hedlund–Lyndon theorem

Known as: Curtis-Hedlund-Lyndon theorem, Hedlund's theorem 
The Curtis–Hedlund–Lyndon theorem is a mathematical characterization of cellular automata in terms of their symbolic dynamics. It is named after… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
In this note we propose an alternative definition for sliding block codes between shift spaces. This definition coincides with… 
2016
2016
We introduce cellular automata whose cell spaces are left homogeneous spaces and prove a uniform as well as a topological variant… 
2015
2015
In this note we propose an alternative definition for sliding block codes between shift spaces. This definition coincides with… 
Highly Cited
2008
Highly Cited
2008
We compare the convergence behavior of Gauss quadrature with that of its younger brother, Clenshaw-Curtis. Seven-line MATLAB… 
Highly Cited
2006
Highly Cited
2006
Corporate governance (gongsi zhili) is a concept whose time has come in China, and the institution of the independent director is… 
Highly Cited
2003
Highly Cited
2003
Because war is costly and risky, states have incentives to negotiate and avoid conflict. The common rationalist explanation is… 
Highly Cited
2002
Highly Cited
2002
Studies of patterns in assemblages of epiphytic macroalgae growing on seagrasses have largely focussed at the scale of leaves or… 
Highly Cited
1996
Highly Cited
1996
Bacterial utilization of high-molecular-weight (HMW; > 1 kDa) and low-molecular-weight (LMW; < 1 kDa) dissolved organic C (DOC… 
Highly Cited
1974
Highly Cited
1974
For G = G(q), a Chevalley group defined over the field iFQ of characteristic p, let Z(G,p) be th e smallest integer t > 1 such…