My Account Log in

1 option

Solvable Cellular Automata : Methods and Applications / by Henryk Fukś.

SpringerLink Books Physics and Astronomy eBooks 2023 Available online

View online
Format:
Book
Author/Creator:
Fukś, Henryk.
Series:
Understanding Complex Systems, 1860-0840
Language:
English
Subjects (All):
System theory.
Computer science.
Dynamics.
Nonlinear theories.
Mathematical physics.
Complex Systems.
Theory of Computation.
Applied Dynamical Systems.
Mathematical Physics.
Local Subjects:
Complex Systems.
Theory of Computation.
Applied Dynamical Systems.
Mathematical Physics.
Physical Description:
1 online resource (304 pages)
Edition:
1st ed. 2023.
Place of Publication:
Cham : Springer Nature Switzerland : Imprint: Springer, 2023.
Summary:
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 one. In the first chapter the basic concepts of cellular automata theory are introduced. Deterministic initial value problem is introduced next and solutions for selected simple rules are also presented. In the following chapters various techniques for solving the deterministic problem are introduced, using elementary CA rules of increasing complexity as examples. The second part of the book introduces the concept of probability measure in the context of cellular automata and the probabilistic initial value problem for both deterministic and probabilistic rules. The book is amply illustrated with examples and applications such as the density classification problem, phase transitions in traffic models or the diffusion of innovations model. In the appendix, solution formulae (both deterministic and probabilistic) for over 60 elementary cellular automata rules are listed. Ruelle-Frobenius-Perron equations for all 88 minimal elementary cellular automata are also provided. .
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.
Notes:
Description based on publisher supplied metadata and other sources.
Other Format:
Print version: Fukś, Henryk Solvable Cellular Automata
ISBN:
9783031387005
OCLC:
1404459687

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account