Complexity of linear cellular automata over Zm*

  • Authors:
  • Xiaogang Jin;Weihong Wang

  • Affiliations:
  • AI Institute, College of Computer Science, Zhejiang university, Hangzhou, China;College of Software, Zhejiang University of Technology, Hangzhou, China

  • Venue:
  • ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part I
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Cellular automata(CA) is not only a discrete dynamical system with infinite dimensions, but also an important computational model. How simple can a CA be and yet support interesting and complicated behavior. There are many unsolved problems in the theory of CA, which appeal many researchers to focus their attentions on the field, especially subclass of CA – linear CA. These studies cover the topological properties, chaotical properties, invertibility, attractors and the classification of linear CA etc.. This is a survey of known results and open questions of D-dimensional linear CA over ℤm.