arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2410.05947cs.FLcs.CC
收藏

最大长度元胞自动机:综述

Maximal Length Cellular Automata : A Survey

Sumit Adak, Sukanta Das

AI总结:

该综述聚焦最大长度元胞自动机理论,梳理其与本原多项式的关联,汇总经典及最新研究成果与证明文献,提出开放问题,并补充新定理和推论以填补研究空白,为相关研究者提供教程参考。

摘要:

本文综述了元胞自动机(Cellular Automata, CAs)研究的若干理论方面,重点探讨了最大长度CA。n元胞CA是指除一个构型外,其余所有构型构成单个循环的CA。最大长度CA与本原多项式(primitive polynomial)存在关联,因此本原多项式在本综述中占据较大篇幅。本综述的主要目标是向研究人员提供最大长度CA理论的教程,涵盖最大性相关的经典与最新成果;同时整理已知结果并附上其证明的参考文献,还提出了一些开放问题。此外,本文新增了若干定理和推论,以填补多个已知结果之间的空白。

英文摘要:

This article surveys some theoretical aspects of Cellular Automata (CAs) research. In particular, we discuss on maximal length CA. An n-cell CA is a maximal length CA, if all the configurations except one form a single cycle. There is a bonding between maximal length CA and primitive polynomial. So, primitive polynomials occupy a good amount of space in this survey. The main goal of this survey is to provide a tutorial on maximal length CA theory to researchers with classical and new results on maximality. We also give a compact collection of known results with references to their proofs, and to suggest some open problems. Additionally, some new theorems and corollaries are added to bridge the gaps among several known results.

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

↑