Claviatures for Generalized Cellular Automata

a

1111

1112

b

1121

1122

1123

c

1211

1212

1213

d

1221

1222

1223

e

2121

2122

2123

f

2211

2212

2213

g

2221

2222

2223

h

2111

2112

2113

i

2131

2132

2133

2130

j

1231

1232

1233

1230

k

2231

2232

2233

2230

l

2311

2312

2313

2310

m

2321

2322

2323

2320

n

2331

2332

2333

2330

o

2301

2302

2303

2300

steps

3

mesh

This Demonstration shows the feasibility of "generalized cellular automata" as subrule and morphogrammatically based constructs.

There are three principal themes in this Demonstration:

1. The definition of the CA as a morphogram, instead of as a set-based CA.2. The introduction of the subrule approach to define the rules of specific CAs.3. The application of claviatures as keyboards to define particular CAs.

The situation is obviously quite different for more complex CA systems—that is, for CAs with range and colors greater than 2.