Wolfram Language & System 10.3 (2015)|Legacy Documentation

This is documentation for an earlier version of the Wolfram Language.View current documentation (Version 11.2)


generates a list representing the evolution of the substitution system with the specified rule from initial condition init for t steps.

gives the result of evolving init for one step.

is an operator form of SubstitutionSystem that corresponds to one step of evolution.


  • In SubstitutionSystem[rule,], rule can be of the following forms:
  • {i1rhs1,i2rhs2,}list substitution system
    {"s1"rhs1,"s2"rhs2,}string substitution system
  • In list substitution systems, the can be lists of any length or can be rectangular arrays of any depth but all with the same dimensions. They can also be individual elements such as integers.
  • In string substitution systems, the can be strings of any length.
  • Both lists and string substitution systems can have rules that involve patterns, but every object that appears in the must have a transformation defined by the rules given.
  • List substitution systems work with SparseArray objects.
  • In string substitution systems, the initial condition init must be a string; in list substitution systems, it must be an array whose depth is equal to the depth of the .
  • In SubstitutionSystem[rule,init,tspec], the time specification tspec can have any of the following forms:
  • tall steps 0 through t
    {t}a list containing only step t
    {t1,t2}steps through
    {t1,t2,dt}steps , ,
Introduced in 2015