Abstract

Any (deterministic) cellular automaton (CA) can be completely determined by a certain associated natural number, called its code. Since these numbers are relatively big for more complicated CA, it becomes naturally to introduce another kind of codes (smaller) to characterize some special classes of CA. It is our aim in this paper to establish a connection between the codes associated to semitotalistic CA and the ones associated to general CA. We also give a necessary and sufficient condition on an arbitrary CA (represented by its code) to be a semitotalistic CA.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call