Selected problems in the theory of classical cellular automata
Publisher: Kindle press
Published: 6/11/2018
Place of publication: USA
Language: eng
Format: Paperback
Number of pages: 410
ISBN-13: 9781730950377
Copyright date: 6/11/2018
Description: In the book we present certain results of the work we have done in the theory of Classical Cellular Automata (CA). At present, these results form an essential constituent of the CA problematics. In particular, we have studied such problems as the nonconstructability problem in the CA, the decomposition problem of global transition functions in the CA, extremal constructive possibilities, the parallel formal grammars and languages defined by CA, complexity of finite configurations and global transition functions in the CA, simulation problem in classical CA, etc. At present, the CA problematics is a rather well developed independent field of the mathematical cybernetics that has a rather considerable field of various appendices. In addition, with the equal right the CA problematics can be considered as a component of such fields as discrete parallel dynamical systems, discrete mathematics, cybernetics, complex systems and some others. In our viewpoint, the book will represent an indubitable interest for students, post–graduates and persons working for doctor's degree of the appropriate faculties of universities, above all, of naturally scientific level along with teachers in subjects such as mathematical and physical modelling, discrete mathematics, automata theory, computer science, cybernetics, theoretical biology, computer technique, and a lot of others. In recent years, the classical CA models are one of the most promising simulating environments for various highly parallel discrete processes, objects and phenomena admitting reversible dynamics, that is enough important from a physical point of view, in the first place.
Table of contents: label: Introduction
title: 5; label: Chapter 1. The basic concepts of classical cellular automata
title: 18; label: Chapter 2. Nonconstructability problem in the classical cellular automata (classical CA models)
title: 40; label: Chapter 3. Extremal constructive opportunities of the classical cellular automata
title: 149; label: Chapter 4. The complexity problem of finite configurations in the classical CA models
title: 209; label: Chapter 5. Parallel formal grammars and languages determined by the classical cellular automata (CA models)
title: 224; label: Chapter 6. The modelling problem in the classical cellular automata (CA) along with the related questions
title: 247; label: Chapter 7. The decomposition problem of global transition functions in the classical CA models
title: 309; label: Chapter 8. Certain applied aspects of the CA problematics
title: 366; label: Conclusion
title: 388; label: References
title: 391; label: About the authors
title: 409