Contents

• Contents
• 1. Introduction
• 2. Choices in the construction of CA
  • 2.1 Lattice geometry
    • 2.1.1 One dimension
    • 2.1.2 Two dimensions
    • 2.1.3 Three dimensions
  • 2.2 Neighborhood size
  • 2.3 Boundary conditions
  • 2.4 Initial conditions
  • 2.5 State set
  • 2.6 Transition rule
    • 2.6.1 Direct Specification
    • 2.6.2 Multi-step rules
    • 2.6.3 Probabilistic rules
  • 2.7 Reversible CA
    • 2.7.1 Partitioned Cellular Automata
    • 2.7.2 Block Cellular Automata
  • 2.8 Summary of construction choices
• 3. Languages for Cellular Automata
  • 3.1 Specification of CA in Java
  • 3.2 CDL
    • 3.2.1 CDL Example
    • 3.2.2 CDL Basics
    • 3.2.3 Type declaration
    • 3.2.4 Variables
    • 3.2.5 Transition Rule
    • 3.2.6 Expressions
    • 3.2.7 Groups
    • 3.2.8 Functions
    • 3.2.9 Constants
    • 3.2.10 Color and Icons
    • 3.2.11 Initial conditions
• 4. Efficient simulation of CA
  • 4.1 Translating CDL to Java
    • 4.1.1 Groups
    • 4.1.2 Statements in expressions
    • 4.1.3 Record types
    • 4.1.4 Neighbor access
  • 4.2 Table-lookup coding
    • 4.2.1 Determine active neighborhood
    • 4.2.2 Calculate size of input configuration
    • 4.2.3 Generate masks and shifts for neighbor components
    • 4.2.4 Fill the table
    • 4.2.5 Generate Java code to use the table
    • 4.2.6 Limitations
  • 4.3 Coding as a logic function
    • 4.3.1 Logic minimization
    • 4.3.2 Using BDDs to find a compact representation
    • 4.3.3 Storing a CA for logic coding
    • 4.3.4 Multispin storage
• Bibliography