arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2406.05642nlin.CGcs.DS
收藏

带记忆元胞自动机的可逆性:纠正错误与新结论

The Invertibility of Cellular Automata with Menory: Correcting Errors and New Conclusions

Chen Wang, Xiang Deng, Chao Wang

AI总结:

本文纠正了现有文献中关于带记忆元胞自动机可逆性条件的错误,结合 Amoroso 算法与循环图给出一维 CAM 可逆性的正确充要条件,并提出一种同构且可逆性易判定的替代元胞自动机。

摘要:

带记忆元胞自动机(CAM)广泛应用于图像处理、模式识别、仿真和密码学等领域。CAM 的可逆性通常被认为是混沌的。论文 [Invertible behavior in elementary cellular automata with memory, Juan C. Seck-Tuoh-Mora et al., Information Sciences, 2012] 给出了初等 CAM 可逆性的充要条件,但其中存在一个关键错误:它将恒等 CAM 归类为不可逆,而恒等 CAM 无疑是可逆的。通过整合 Amoroso 算法和循环图,我们给出了一维 CAM 可逆性的正确充要条件。此外,我们将 CAM 与一种特定类型的元胞自动机联系起来,该元胞自动机与 CAM 同构、行为完全相同,且其可逆性易于判定。这使其成为 CAM 应用中一种有前景的替代工具。

英文摘要:

Cellular automata with memory (CAM) are widely used in fields such as image processing, pattern recognition, simulation, and cryptography. The invertibility of CAM is generally considered to be chaotic. Paper [Invertible behavior in elementary cellular automata with memory, Juan C. Seck-Tuoh-Mora et al., Information Sciences, 2012] presented necessary and sufficient conditions for the invertibility of elementary CAM, but it contains a critical error: it classifies identity CAM as non-invertible, whereas identity CAM is undoubtedly invertible. By integrating Amoroso's algorithm and cycle graphs, we provide the correct necessary and sufficient conditions for the invertibility of one-dimensional CAM. Additionally, we link CAM to a specific type of cellular automaton that is isomorphic to CAM, behaves identically, and has easily determinable invertibility. This makes it a promising alternative tool for CAM applications.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑