跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2610.33131 · v2

Locally eventually onto cellular automata

首次提交 2026-10-23 21:29
版本更新 2026-11-19 23:23
雷达观测 2026-11-20 14:52
arXiv ↗PDF ↗

摘要

We give a new checkable criterion to ensure that a one-dimensional cellular automaton on a finite alphabet is open and locally eventually onto. In this setting, openness is equivalent to being n-to-1 for some n and therefore implies surjectivity. Bipermutive cellular automata are known to be open and locally eventually onto, while open cellular automata that are neither bipermutive nor bijective appear to have received less attention. Building on Sutner's work with de Bruijn graphs, we describe a method for deciding openness and at the same time determining n. We then introduce the notion of block-regularity of local rules as a generalization of bipermutivity and prove that it implies openness. We further identify two conditions that, together with block-regularity, ensure that every nonempty cylinder set is mapped onto the whole configuration space after a finite number of iterations, and hence that the cellular automaton is open and locally eventually onto. The appendix provides the algorithms that check these finite criteria and then presents examples of open, locally eventually onto, non-bipermutive cellular automata for small diameters.

作者备注:33 pages, minor revision

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

本站首次收录为 v2,暂无更早版本可对照。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v2 · 2026-11-19 23:23 · 最新观测版本

Locally eventually onto cellular automata

We give a new checkable criterion to ensure that a one-dimensional cellular automaton on a finite alphabet is open and locally eventually onto. In this setting, openness is equivalent to being n-to-1 for some n and therefore implies surjectivity. Bipermutive cellular automata are known to be open and locally eventually onto, while open cellular automata that are neither bipermutive nor bijective appear to have received less attention. Building on Sutner's work with de Bruijn graphs, we describe a method for deciding openness and at the same time determining n. We then introduce the notion of block-regularity of local rules as a generalization of bipermutivity and prove that it implies openness. We further identify two conditions that, together with block-regularity, ensure that every nonempty cylinder set is mapped onto the whole configuration space after a finite number of iterations, and hence that the cellular automaton is open and locally eventually onto. The appendix provides the algorithms that check these finite criteria and then presents examples of open, locally eventually onto, non-bipermutive cellular automata for small diameters.

查看此版本解读 →查看此版本原文 ↗