Abstract: A subclass of cellular automata called linear cellular automata over Zm is studied. Criteria for surjectivity and injectivity of the global transition function of such a cellular automaton are presented. The question of reappearance of patterns for such cellular automata is also dealt with.
Publication Year: 1983
Publication Date: 1983-08-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 86
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot