Index of modules

if sum_of_neighbours >= nb_neighbours then 0 else 1.

One dimensionnal arrays that represent two dimensionnal data.

The chi square statistical test.

The main module, from where the whole process is launched.

LIFO; Can be changed to Stack (FIFO).

Merge probability distributions.

External library (part of the Cameleon project) to read and write configuration file, included here to simplify distribution.

Cyclic Cellular Automata

Computes the average density of unsynchronized states, same paper.

Prints data for a density (of unsynchronized states) vs time plot, same paper.

Elementary Cellular Automata

Defines how to run a Cellular Automaton, what to measure and when to measure it.

Implements reusable functions which aren't in the standard lib, as needs are encountered.

Can be used only on a 2D periodic topology with no holes nor missing links, need Sphere2 Meta topology

Creates the initial configuration and repartition.

The Ising model

Create 1D topologies.

Also used to initialize a rectangle when there are no local dependencies.

Computes the Local Lyapunov Exponent, see same paper.

Launches the provided Experiment

if sum_of_neighbours > nb_neighbours then 1 else 0.

Helper functions for the module Experiment.

Modifies a given topology.

Computes the order parameter and derives the free energy, see same paper.

Runs two ECA in parallel: each cell contains two states.

Create 2D topologies.

2D rules that are Rotation Reflexion and Conjugate Symmetric, with range one diamond neighboorhoud.

"p" for "pseudo conjugate", a slight (buggy) variation (conjugating only the center cell) of rrcs2d

Definition of the cellular automata

The Bak, Tang and Wiesenfeld sandpile model.

Computes the statistical complexity, as defined in Cosma Shalizi, Rob Haslinger, Jean-Baptiste Rouquier, Kristina Lisa Klinkner and Cristopher Moore, "Automatic Filters for the Detection of Coherent Structure in Spatiotemporal Systems", nlin.CG/0508001, Physical Review E.

Simulates and draw the states of a CA.

Statistic functions, as needs are encountered.

The way the transition rule is applied, see Types.Synchronism.next_step.

Computes the time needed to synchronize two eca, corresponding paper accepted.

Factorization of code for Cellular Automata with usual types.

Create the neighbourhoods according to different topologies.

Totalizing rules, ie rules that depends only on the sum of the states of theirs neighbours (includes the famous Conway's game of life, majority).

Data types used everywhere in the code.

Self explaining.