Exploring CA State Space to Synthesize Cellular Automata with Specified Attractor Set

Authors:
Sukanta Das;Chandrama Shaw;Biplab K. Sikdar
Affiliations:
Dept. of Information Technology, Bengal Engineering & Science University, Shibpur, India 711103;Dept. of Information Technology, Bengal Engineering & Science University, Shibpur, India 711103;Dept. of Computer Science & Technology, Bengal Engineering & Science University, Shibpur, India 711103
Venue:
ACRI '08 Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry
Year:
2008

Citing 3
Cited 0

Theory and application of cellular automata for pattern classification

Fundamenta Informaticae - Special issue on cellular automata
Cellular Automata

Cellular Automata
Theory of Self-Reproducing Automata

Theory of Self-Reproducing Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

The cellular automaton (CA) with multiple attractors in its state space creates immense interest to devise solutions for pattern classification, pattern recognition, design of associative memory, query processing, etc. This work characterizes the CAstate space to explore the essential properties of 1-dimensional nonlinear cellular automata with single cycle attractors. The characterization of pseudo-exhaustive bits (PEbits) is done to uniquely identify the attractor set of such a CA. Theoretical framework thus evolved provides means to synthesize a CAfor a given attractor set with specified PEbits.