<テクニカルレポート>
Period Lengths of Cellular Automata cam - 90 with Memory

作成者
本文言語
出版者
発行日
雑誌名
出版タイプ
アクセス権
概要 Cellular automata ca -90 have states 0 and I , and their dynamics, driven by the local transition rule 90, can be simply represented with Laurent polynomials over a finite field $ F2 = left{0, 1 \righ...t} $. Cellular automata cam-90 with memory, whose configurations are pairs of those of ca-90, are introduced as a useful machinery to solve certain equations on configurations, in particular, to compute fixed or kernel configurations of ca - 90. This paper defines a notion of linear dynamical systems with memory, states their basic properties, and then studies some period lengths of one-dimensional and two-dimensional cellular automata cam - 90 with memory.続きを見る

本文情報を非表示

rifis-tr-119 pdf 868 KB 117  

詳細

レコードID
査読有無
関連情報
タイプ
登録日 2009.04.22
更新日 2017.01.20