Identifying cellular automata rules

被引:0
|
作者
Maeda, Ken-Ichi [1 ]
Sakama, Chiaki [1 ]
机构
[1] Wakayama Univ, Dept Comp & Commun Sci, Wakayama 6408510, Japan
关键词
cellular automata; identification problem; genetic programming; decision tree;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
This paper studies a method for identifying cellular automata rules (CA rules). Given a sequence of CA configurations, we first seek an appropriate neighborhood of a cell and collect cellular changes of states as evidences. The collected evidences are then classified using a decision tree, which is used for constructing CA transition rules. Conditions for classifying evidences in a decision tree are computed using genetic programming. We perform experiments using several types of CAs and verify that the proposed method successfully identifies correct CA rules.
引用
收藏
页码:1 / 20
页数:20
相关论文
共 50 条
  • [1] Identifying Cellular Automata Rules Using Local Rule Network From Spatiotemporal Patterns
    Ueda, Takuya
    Ishida, Yoshiteru
    PROCEEDINGS OF THE SEVENTEENTH INTERNATIONAL SYMPOSIUM ON ARTIFICIAL LIFE AND ROBOTICS (AROB 17TH '12), 2012, : 303 - 306
  • [2] On Cellular Automata rules of molecular arrays
    Satyajit Sahu
    Hiroshi Oono
    Subrata Ghosh
    Anirban Bandyopadhyay
    Daisuke Fujita
    Ferdinand Peper
    Teijiro Isokawa
    Ranjit Pati
    Natural Computing, 2012, 11 : 311 - 321
  • [3] Cellular automata with symmetric local rules
    Kornyak, Vladimir V.
    COMPUTER ALGEBRA IN SCIENTIFIC COMPUTING, PROCEEDINGS, 2006, 4194 : 240 - 250
  • [4] On Cellular Automata rules of molecular arrays
    Sahu, Satyajit
    Oono, Hiroshi
    Ghosh, Subrata
    Bandyopadhyay, Anirban
    Fujita, Daisuke
    Peper, Ferdinand
    Isokawa, Teijiro
    Pati, Ranjit
    NATURAL COMPUTING, 2012, 11 (02) : 311 - 321
  • [5] Topological Chaos of Cellular Automata Rules
    Jin, Weifeng
    Chen, Fangyue
    Yang, Chunlan
    2009 INTERNATIONAL WORKSHOP ON CHAOS-FRACTALS THEORIES AND APPLICATIONS (IWCFTA 2009), 2009, : 216 - +
  • [6] Topology optimization with efficient rules of cellular automata
    Bochenek, Bogdan
    Tajs-Zielinska, Katarzyna
    ENGINEERING COMPUTATIONS, 2013, 30 (08) : 1086 - 1106
  • [7] An algorithm of finding rules for a class of cellular automata
    Kou, Lei
    Zhang, Fangfang
    Chen, Luobing
    Ke, Wende
    Yuan, Quande
    Wan, Junhe
    Wang, Zhen
    INTERNATIONAL JOURNAL OF BIO-INSPIRED COMPUTATION, 2023, 21 (04) : 189 - 199
  • [8] Determinism in cellular automata - Investigation of transition rules
    Supratid, S
    Sadananda, R
    PROCEEDINGS OF INTERNATIONAL CONFERENCE ON INTELLIGENT SENSING AND INFORMATION PROCESSING, 2004, : 391 - 396
  • [9] Evolution of Cellular Automata with Conditionally Matching Rules
    Bidlo, Michal
    Vasicek, Zdenek
    2013 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2013, : 1178 - 1185
  • [10] Discovery of cellular automata rules using cases
    Maeda, K
    Sakama, C
    DISCOVERY SCIENCE, PROCEEDINGS, 2003, 2843 : 360 - 368