Extracting Boolean rules from CA patterns

Authors:
  • SBS.A. Billings
    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 noise.

This publication has 13 references indexed in Scilit: