| 作成者 |
|
|
|
| 本文言語 |
|
| 出版者 |
|
|
|
| 発行日 |
|
| 収録物名 |
|
| 巻 |
|
| 出版タイプ |
|
| アクセス権 |
|
| 関連DOI |
|
|
|
| 関連URI |
|
|
|
| 関連情報 |
|
|
|
| 概要 |
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.続きを見る
|
Mendeley出力
rifis-tr-119