Solvable Cellular Automata Methods and Applications /

The main focus of the book is solvability of cellular automata, that is, expressing the state of a given cell after a given number of steps by an explicit formula. The author considers solutions of two types of initial value problems for cellular automata, the deterministic one and the probabilistic...

Full description

Saved in:
Bibliographic Details
Main Author: Fukś, Henryk (Author)
Corporate Author: SpringerLink (Online service)
Format: Electronic eBook
Language:English
Published: Cham : Springer Nature Switzerland : Imprint: Springer, 2023.
Edition:1st ed. 2023.
Series:Understanding Complex Systems,
Subjects:
Online Access:https://doi.org/10.1007/978-3-031-38700-5
Tags: Add Tag
No Tags, Be the first to tag this record!
Table of Contents:
  • Deterministic cellular automata
  • Deterministic initial value problem
  • Multiplicative and additive rules
  • More complex rules
  • Exploiting rule identities
  • Rules with additive invariants
  • Construction of probability measures
  • Probabilistic solutions
  • Probabilistic cellular automata
  • Applications
  • Local structure approximation
  • Non-solvable rules
  • Appendices.