arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0407116math.DSmath.CO
收藏

离散Baker变换与元胞自动机

Discrete Baker Transformation and Cellular Automata

Valeriy K. Bulitko

摘要:

在本文中,我们提出了一个规则无关的描述应用程序的细胞自动机规则一维加法细胞自动机上的有限大小的圆柱。这种描述被证明是一个有用的工具,用于回答有关自动机的状态转换图(STD)的问题。该方法基于两个变换:一个(称为{ \sl Baker变换})作用于$n$ -维布尔立方体$\frak B^n$,另一个(称为{ \sl索引-Baker变换})作用于幂$n$的循环群。$\frak B^n$中Baker变换的单图包含了关于$n$大小的柱面上所有自动机的重要信息。这种方法所得到的一些结果可以看作是O。Martin,A. Odlyzko,S. Wolfram此外,我们的方法导致一个方便的语言制定的属性,如拥有一定长度的周期和给定的图表高度,自动机规则。

英文摘要:

In this paper we propose a rule-independent description of applications of cellular automata rules for one-dimensional additive cellular automata on cylinders of finite sizes. This description is shown to be a useful tool for for answering questions about automata's state transition diagrams (STD). The approach is based on two transformations: one (called {\sl Baker transformation}) acts on the $n$-dimensional Boolean cube $\frak B^n$ and the other (called {\sl index-baker transformation}) acts on the cyclic group of power $n$. The single diagram of Baker transformation in $\frak B^n$ contains an important information about all automata on the cylinder of size $n$. Some of the results yielded by this approach can be viewed as a generalization and extension of certain results by O. Martin, A. Odlyzko, S. Wolfram. Additionally, our approach leads to a convenient language for formulating properties, such as possession of cycles with certain lengths and given diagram heights, of automaton rules.

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

↑