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

可逆一阶单元胞自动机的代数刻画

Algebraic Characterization of Reversible First Degree Cellular Automata over $\mathbb{Z}_d$

National Institute of Technology, Tiruchirappalli(国立技术学院特鲁奇拉帕利分校);Indian Institute of Engineering Science and Technology, Shibpur(印度工程科学和技术学院希布尔校区)

Baby C. J., Kamalika Bhattacharjee

AI总结:

本文提出了一种在常数时间内判断一阶单元胞自动机可逆性的方法,通过验证三个代数条件来确保其在任意晶格大小下均具有可逆性。

摘要:

对于有限和无限晶格,存在能够在二次时间内检测单元胞自动机(CA)可逆性的算法。但,能否在常数时间内识别出一个具有d个状态的CA规则,使其在任意晶格大小n∈ℕ时都可逆?为解决这一问题,本文探讨了一种一维、3邻域、d状态有限单元胞自动机(CAs)的可逆性性质,称为一阶单元胞自动机(FDCAs),适用于任意数量的单元(n∈ℕ)在零边界条件下。在第一度单元胞自动机(FDCA)中,局部规则由八个参数定义。为了确保d状态FDCA的全局转移函数在任意数量的单元(n∈ℕ)下可逆,只需验证参数值中的三个代数条件即可。基于这些条件,对于任意给定的d,可以合成所有可逆FDCAs规则。同样,给定一个FDCA规则,可以通过检查这些条件来决定其可逆性,这可以在常数时间内完成。

英文摘要:

There exists algorithms to detect reversibility of cellular automaton (CA) for both finite and infinite lattices taking quadratic time. But, can we identify a $d$-state CA rule in constant time that is always reversible for every lattice size $n\in \mathbb{N}$? To address this issue, this paper explores the reversibility properties of a subset of one-dimensional, $3$-neighborhood, $d$-state finite cellular automata (CAs), known as the first degree cellular automata (FDCAs) for any number of cells $(n\in \mathbb{N})$ under the null boundary condition. {In a first degree cellular automaton (FDCA), the local rule is defined using eight parameters. To ensure that the global transition function of $d$-state FDCA is reversible for any number of cells $(n\in \mathbb{N})$, it is necessary and sufficient to verify only three algebraic conditions among the parameter values. Based on these conditions, for any given $d$, one can synthesize all reversible FDCAs rules. Similarly, given a FDCA rule, one can check these conditions to decide its reversibility in constant time.

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

↑