Location of Repository

Extracting Boolean rules from CA patterns \ud

By Y.X. Yang and S.A. Billings

Abstract

A multiobjective genetic algorithm (GA) is introduced to identify both the neighborhood and the rule set in the form of a parsimonious Boolean expression for both one- and two-dimensional cellular automata (CA). Simulation results illustrate that the new algorithm performs well even when the patterns are corrupted by static and dynamic nois

Year: 2000
OAI identifier: oai:eprints.whiterose.ac.uk:796

Suggested articles

Preview


To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.