通过规则110中称为阶段fi_1的基于滑动器的结构来确定正则语言
Determining a regular language by glider-based structures called phases fi_1 in Rule 110
摘要:
规则110是一个复杂的基本元胞自动机,能够支持通用计算和滑翔机之间复杂的基于碰撞的反应。我们提出了一个表示编码的初始条件的有限子集的正则表达式。这些序列是从德布鲁因图和规则110中为每个滑翔机指定一组相位fi_1的图块中提取的。详细解释了正则表达式的子集。
英文摘要:
Rule 110 is a complex elementary cellular automaton able of supporting universal computation and complicated collision-based reactions between gliders. We propose a representation for coding initial conditions by means of a finite subset of regular expressions. The sequences are extracted both from de Bruijn diagrams and tiles specifying a set of phases fi_1 for each glider in Rule 110. The subset of regular expressions is explained in detail.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。