The algebraic properties of finite cellular automata

研究成果: Article査読

2 被引用数 (Scopus)

抄録

The basic patterns by cellular automata have been phenomenologically classified into four types by Wolfram. I propose a new algebraic method to predict the types of patterns by the elementary cellular automata. This method is one example of the application of Brownian algebra, which is very important in the area of cognitive science. The classification carried out by this method is in good agreement with Wolfram's classification. A significant difference in the present classification is that class 3 by Wolfram is divided into two types. This difference is apparent in the property of the filter automata which are constructed by the same rule.

本文言語English
ページ(範囲)282-294
ページ数13
ジャーナルPhysica D: Nonlinear Phenomena
41
2
DOI
出版ステータスPublished - 1990 3
外部発表はい

ASJC Scopus subject areas

  • 統計物理学および非線形物理学
  • 数理物理学
  • 凝縮系物理学
  • 応用数学

フィンガープリント

「The algebraic properties of finite cellular automata」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル