Lattice-driven cellular automata implementing local semantics

Daisuke Uragami*, Yukio Pegio Gunji


研究成果: Article査読

8 被引用数 (Scopus)


We propose a model based on Elementary Cellular Automata (ECA) where each cell has its own semantics defined by a lattice. Semantics play the following two roles: (1) a state space for computation and (2) a mediator generating and negotiating the discrepancy between the rule and the state. We call semantics playing such roles 'local semantics'. A lattice is a mathematical structure with certain limits. Weakening the limits reveals local semantics. Firstly, we implement local semantics for ECA and call the result 'Lattice-Driven Cellular Automata' (LDCA). In ECA rules are common and invariant for all cells, and uniquely determine the state changes, whereas in LDCA rules and states interplay with each other dynamically and directly in each cell. Secondly, we compare the space-time patterns of LDCA with those of ECA with respect to the relationship between the mean value and variance of the 'input-entropy'. The comparison reveals that LDCA generate complex patterns more universally than ECA. Lastly, we discuss the observation that the direct interplay between levels yields wholeness dynamically.

ジャーナルPhysica D: Nonlinear Phenomena
出版ステータスPublished - 2008 2月

ASJC Scopus subject areas

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


「Lattice-driven cellular automata implementing local semantics」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。