Screen LibraryComputational analysis of one-dimensional cellular automata /
Cellular automata provide one of the most interesting avenues into the study of complex systems in general, as well as having an intrinsic interest of their own. Because of their mathematical simplicity and representational robustness they have been used to model economic, political, biological, eco...
Saved in:
| Main Authors: | |
|---|---|
| Corporate Authors: | |
| Published: |
World Scientific Pub. Co.,
|
| Publisher Address: | Singapore : |
| Publication Dates: | 1996. |
| Literature type: | eBook |
| Language: | English |
| Series: |
World scientific series on nonlinear science. Series A ;
v. 15 |
| Subjects: | |
| Online Access: |
http://www.worldscientific.com/worldscibooks/10.1142/2712#t=toc |
| Summary: |
Cellular automata provide one of the most interesting avenues into the study of complex systems in general, as well as having an intrinsic interest of their own. Because of their mathematical simplicity and representational robustness they have been used to model economic, political, biological, ecological, chemical, and physical systems. Almost any system which can be treated in terms of a discrete representation space in which the dynamics is based on local interaction rules can be modelled by a cellular automata. The aim of this book is to give an introduction to the analysis of cellular |
| Carrier Form: | 1 online resource (x,275pages) : illustrations (some color). |
| Bibliography: | Includes bibliographical references. |
| ISBN: | 9789812798671 |
| CLC: | TP301.1 |
| Contents: | ch. 1. The operator algebra of cellular automata. 1. Basic definitions and notation. 2. Boolean forms of CA rules. 3. The canonical basis operators. 4. Symmetry transformations on CA rules. 5. CA rules as maps of the interval. 6. Exercises for chapter 1 -- ch. 2. Cellular automata arithmetic. 1. Products of CA rules. 2. The division algorithm. 3. Residue arithmetic of cellular automata. 4. Exercises for chapter 2 -- ch. 3. Fixed points and cycles. 1. Fixed points and shift cycles via rule decomposition. 2. Jen's invariance matrix method. 3. Exercises for chapter 3 -- ch. 4. Commutation of CA |