本文对至少存在一个不动点的初等元胞自动机（Elementary Cellular Automata）在顺序更新模式下的收敛性进行了理论分析。我们的目标是确定哪些初等规则在任意初始构型下，均能在顺序更新模式下最终达到不动点。在此框架下，我们依据这些规则在同步（或并行）更新模式下是否具有不动点，将其分类为：在所有、部分、某一种或无任何顺序更新模式下，所有初始构型均能收敛。

In this paper, we perform a theoretical analysis of the sequential convergence of elementary cellular automata that have at least one fixed point. Our aim is to establish which elementary rules always reach fixed points under sequential update modes, regardless of the initial configuration. In this context, we classify these rules according to whether all initial configurations converge under all, some, one or none sequential update modes, depending on if they have fixed points under synchronous (or parallel) update modes.