Extracting the rules from spatio-temporal patterns generated by the evolution of cellular automata (CA) usually produces a CA rule table without providing a clear understanding of the structure of the neighborhood or the CA rule. In this paper, a new identification method based on using a modified orthogonal least squares or CA-OLS algorithm to detect the neighborhood structure and the underlying polynomial form of the CA rules is proposed. The Quine-McCluskey method is then applied to extract minimum Boolean expressions from the polynomials. Spatio-temporal patterns produced by the evolution of 1D, 2D, and higher dimensional binary CAs are used to illustrate the new algorithm, and simulation results show that the CA-OLS algorithm can quickly select both the correct neighborhood structure and the corresponding rule.
Identification of the neighborhood and CA rules from spatio-temporal CA patterns
Published 2003 in IEEE Trans. Syst. Man Cybern. Part B
ABSTRACT
PUBLICATION RECORD
- Publication year
2003
- Venue
IEEE Trans. Syst. Man Cybern. Part B
- Publication date
2003-04-01
- Fields of study
Mathematics, Computer Science, Medicine
- Identifiers
- External record
- Source metadata
Semantic Scholar, PubMed
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-10 of 10 references · Page 1 of 1
CITED BY
Showing 1-31 of 31 citing papers · Page 1 of 1