## Classical Cellular Automata. Homogeneous StructuresBook on cellular automata (CA) considers such questions as nonconstructible configurations, extremal possibilities of CA, complexity of finite configurations and global transition functions, modeling in CA, decomposition of global transition functions, appendices of CA, etc. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Classical Cellular Automata Homogeneous Structures List of the adopted abbreviations and designations | 6 |

Classical Cellular Automata Homogeneous Structures Introduction | 8 |

Classical Cellular Automata Homogeneous Structures Chapter 1 The basic concept of homogeneous structures HSmodels Cellular Automata | 24 |

Classical Cellular Automata Homogeneous Structures Chapter 2 Nonconstructability problem in classical homogeneous structures Cellular Automata | 79 |

Classical Cellular Automata Homogeneous Structures Chapter 3 Extremal constructive opportunities of the classical homogeneous structures | 187 |

Classical Cellular Automata Homogeneous Structures Chapter 4 Problem of complexity of finite configurations in classical homogeneous structures | 226 |

Classical Cellular Automata Homogeneous Structures Chapter 5 Parallel formal grammars and languages defined by homogeneous structures | 241 |

Classical Cellular Automata Homogeneous Structures Chapter 6 The modelling problem in the classical homogeneous structures along with related qu... | 264 |

Classical Cellular Automata Homogeneous Structures Chapter 7 The decomposition problem of global transition functions in the classical HSmodels | 327 |

Classical Cellular Automata Homogeneous Structures Chapter 8 Some applied aspects of HSproblematics | 373 |

Classical Cellular Automata Homogeneous Structures Conclusion | 438 |

Classical Cellular Automata Homogeneous Structures References | 440 |

### Common terms and phrases

algorithmically solvable allows appendices applied aspects approach arbitrary classical structure automaton base basis biological block configurations cellular automata classical d–HS classical HS–models classical structures d–HS complexity composition concept concerning considered d-HS d–dimensional d–PDF decomposition problem defined definition determined elementary automata essential example finite configurations formal formal grammars given direction given problem global functions global transition functions grammars homogeneous space HS–concept HS–problematics infinite integer interesting enough results languages L(n linear mathematical Meanwhile minimal modelling structure Moore's sense n–grammars namely neighbourhood index neighbourhood template nonconstructability problem nonconstructible configurations pairs of MEC parallel grammars parallel substitutions polygenic polynomial possess the nonconstructability possess the property possible predecessors presented processes property of universal questions received represented reversibility reversible computing self–reproducing semigroup sense of finite series of interesting set C(A,d simple simulation solution standpoint structures d–HS d≥1 structures possessing takes place theorem theory Turing machine universal reproducibility whereas whole series