× Table of content A. One dimensional cellular automata I. Totalistic II. Elementary III. Continuous IV. Stochastic
B. Two dimensional cellular automata: I. Totalistic 1 Triangular tessellation   1.1 Rule 3,5/4     1.1.1 Random soup     1.1.2 Spaceships   1.3 Single point     1.2.1 Unity rule with memory     1.2.2 Parity rule with memory
2 Square tessellation   2.1 Rule 2,3/3: Conway's life     2.1.1 Random soup     2.1.2 Spaceships   2.2 Single point     2.2.1 Unity rule with memory     2.2.2 Parity rule with memory   2.3 Brian's brain   2.4 Forest fire
3 Pentagonal tessellation (Cairo)   3.1 Rule 2,4/3,4,6     3.1.1 Random soup     3.1.2 Spaceships     3.1.3 Oscillators   3.2 Single point     3.2.1 Unity rule with memory     3.2.2 Parity rule with memory
4 Hexagonal tessellation   4.1 Rule 3/2     4.1.1 Random soup     4.1.2 Spaceships     4.1.2 Oscillators   4.2 Single point     4.2.1 Unity rule with memory     4.2.2 Parity rule with memory   4.3 Forest fire
5 1-uniform tiling 488   5.1 Sparkling fire: Rule 2,3,5/2/5     5.1.1 Random soup   5.2 Single point     5.2.1 Unity rule with memory
6 1-uniform tiling 31212   6.1 Rule 3,4,5,6,10/2,4,6,10 with 5 states     6.1.1 Random soup   6.2 Single point     Rule 3,4,5,6,7(17),8(17),9(17),10(17),11(17),12(17)/1,2,3,5 with 17 states
C. Two dimensional Lindenmayer system: I. Deterministic 1. Classic fractals 1.1 Plane filling functions 1.1.1 Hilbert curve 1.1.2 Hilbert curve 2 1.1.3 Peano-Gosper curve 1.1.4 Dragon curve
1.2 Other functions 1.2.1 Sierpinski arrowhead 1.2.2 Sierpinski square 1.2.3 Quadratic Kosh Island 1.2.4 Box Fractal 1.2.5 Pentadendrite 1.2.6 Kosh Snowflake
2. Geometric Trees 2.1 Two branches 2.2 Three branches 2.3 Four branches 2.4 Five branches 2.5 Six branches
3. Organic Trees 3.1 Tree 1 3.2 Tree 2 3.3 Tree 3 3.4 Tree 4 3.5 Tree 5
D. Lindenmayer system in three dimensions: I. Deterministic 1. Classic fractals 1.1.1 Hilbert curve 1.1.2 Tree