Presentation 2015-01-29
Stability of mixed rule cellular automata
Ryo SAWAYAMA, Toshimichi SAITO,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) This paper studies the cellular automata with mixed rules (MCA). The mixed rule consists of two special rules of the elementary cellular automata (ECA) which have no transient state for all steady states. First, we analyze the rules of ECA which have no transient state for all steady states. Second, we present a learning algorithm that tries to optimize the combination of those rules to enlarge transient states for steady states. Performing basic numerical experiments, we analyze the steady states and transient states in the learning process by using the digital return map.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Cellular Automata / Genetic Algorithm / Return Map
Paper # NC2014-57
Date of Issue

Conference Information
Committee NC
Conference Date 2015/1/22(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Neurocomputing (NC)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Stability of mixed rule cellular automata
Sub Title (in English)
Keyword(1) Cellular Automata
Keyword(2) Genetic Algorithm
Keyword(3) Return Map
1st Author's Name Ryo SAWAYAMA
1st Author's Affiliation EE Dept., Hosei University()
2nd Author's Name Toshimichi SAITO
2nd Author's Affiliation EE Dept., Hosei University
Date 2015-01-29
Paper # NC2014-57
Volume (vol) vol.114
Number (no) 437
Page pp.pp.-
#Pages 6
Date of Issue