Solvable Cellular Automata

Name: Solvable Cellular Automata
Brand: Springer Nature
SKU: 9783031386992
Availability: InStock

Best Price (Coupon Required):
Buy Solvable Cellular Automata for $125.10 at @ Link.springer.com when you apply the 10% OFF coupon at checkout.
Click “Get Coupon & Buy” to copy the code and unlock the deal.

Set a price drop alert to never miss an offer.

1 Offer Price Range: $139.00 - $139.00

BEST PRICE

Single Product Purchase

$125.10

@ Link.springer.com with extra coupon

Price Comparison

Seller	Contact Seller	List Price	On Sale	Shipping	Best Promo	Final Price	Volume Discount	Financing	Availability	Seller's Page
BEST PRICE 1 Product Purchase @ Link.springer.com		$139.00	$139.00		10% OFF This deals requires coupon	$125.10		See Site	In stock	Visit Store

Product Details

Brand

Springer Nature

Manufacturer

N/A

Part Number

GTIN

9783031386992

Condition

New

Product Description

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.

Available Colors

N/A

Available Sizes

N/A