Classical Cellular Automata: Mathematical Theory and Applications

In the book we present some of results of the work we have done in theory of classical Cellular Automata (CA) and their appendices during 1969–2013 in truth with considerable pauses. These results at present form essential constituent of the CA problems. In particular, we have studied such problems as the nonconstructability problem in CA, decomposition of global transition functions in CA, extremal constructive possibilities, complexity of finite configurations and global transition functions, parallel formal grammars along with languages defined by CA, the modelling problem in the classical CA, computer simulation of CA, certain applied aspects of CA, etc. At present, the CA problems is a rather well developed independent sphere of the mathematical cybernetics which has considerable field of numerous appendices. At that, with the equal right the CA problems can be considered as a component of such fields as discrete mathematics, the discrete parallel dynamic systems, complex systems and some others. In our opinion the book will present an indubitable interest for students, post–graduates and persons working for doctor's degree of the appropriate faculties of universities.