Extracting Boolean rules from CA patterns
Authors:
- S.A. BillingsSBS.A. Billings
- 1 January 2000
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)
- Vol. 30 (4) , 573-580
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.Keywords
This publication has 13 references indexed in Scilit:
- KGPMIN: an efficient multilevel multioutput AND-OR-XOR minimizerIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1997
- Cellular automata based scheme for solution of Boolean equationsIEE Proceedings - Computers and Digital Techniques, 1996
- Cellular Automata for Elementary Image EnhancementGraphical Models and Image Processing, 1996
- Applying Neural Networks to Find the Minimum Cost Coverage of a Boolean FunctionVLSI Design, 1995
- Genetic Algorithms + Data Structures = Evolution Programs1994
- A cellular automata model for edge relaxationJournal of Intelligent & Robotic Systems, 1991
- Identification of MIMO non-linear systems using a forward-regression orthogonal estimatorInternational Journal of Control, 1989
- An algorithm for identifying and selecting the primed implicants of a multiple-output Boolean functionIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1988
- A fast procedure for finding prime implicants of a boolean functionInternational Journal of Electronics, 1981
- Minimization of Boolean Functions*Bell System Technical Journal, 1956