Driven IFS with Forbidden Combinations

Software Representation

In our software allowed transitions are represented by a 4 × 4 array of squares.

If the square in the ith row and jth column is filled, then Ti can follow Tj. If the square is empty, Ti cannot follow Tj.

For example, in this array all squares are filled, except the square in row 3 and column 1. Then T3 cannot be applied immediately after T1, so the address 31 is empty. allows all combinations except that T3 cannot follow T1.

Here is the corresponding IFS.

Return to Driven IFS with Forbidden Combinations.