Treść książki
Przejdź do opcji czytnikaPrzejdź do nawigacjiPrzejdź do informacjiPrzejdź do stopki
Searchingthespaceofcellularautomatabasingontheanalysis...
11
(a)
(b)
(c)
Fig.4.Graphsmadefor
reg
()
10
2
typerules
Case
reg
()
10
3
Thereare120rulesinthissubclass.18differentgraphsarepossiblefor22
groupsof3configurations.Eachgraphhasupto5nodesand3branches.Thereare
22groupsofrulesforcingdifferentbehaviourofcellularautomata.Becouseofthe
bignumberofgraphs(comparewiththepreviouscase)onlyexamplesofgraphs
areshowninFig.5.
(a)
(b)
(c)
Fig.5.Examplesofgraphsmadefor
reg
()
10
3
typerules
ThegraphsfromFig.5areconnected:(a)with12rules,(b)with4rules,(c)with
2rules.Firstofthemcanbemadefortwoconfigurations:(τ1,τ2,τ3)-whichis
connectedwith4rules,(y,τ2,τ3)-whichisconnectedwith8rules.Theexamples
oftheserulescomputingthenewstateofcellsare:
CCandnotS
forthefirstconfiguration
ifN=SthenWelse(CCandN)
forthesecondone.
Thegraph(b)fromFig.5ismadefortheconfiguration(x,τ2,τ3).Oneof4rules
canbeexpressedas:
ifN=EthenNelseCC.
