Cellular automata are discrete dynamical systems with locally defined behaviour, well known as simple models of complex systems. Classically, their dynamics derive from synchronously iterated rules over finite or infinite configurations; however, since for many natural systems to be modelled, asynchrony seems more plausible, asynchronous iteration of the rules has gained a considerable attention in recent years. One question in this context is how changing the update schedule of rule applications affects the global behaviour of the system. In particular, previous works addressed the notion of maximum sensitivity to changes in the update schemes for finite lattices. Here, we extend the notion to infinite lattices, and classify elementary cellular automata space according to such a property.

元胞自动机是具有局部定义行为的离散动力学系统，众所周知，它是复杂系统的简单模型。传统上，它们的动态性来自有限或无限配置上的同步迭代规则。但是，由于要对许多自然系统进行建模，因此异步似乎更合理，因此近年来，规则的异步迭代已引起相当大的关注。在这种情况下，一个问题是更改规则应用程序的更新时间表如何影响系统的全局行为。特别地，先前的工作解决了对有限晶格的更新方案的变化具有最大敏感性的概念。在这里，我们将概念扩展到无限晶格，并根据这种性质对基本元胞自动机空间进行分类。