From NKS page 209:
From NKS page 209:
In[]:=
MultiwaySystem[{"AA""","BA""ABB","BB""A"},{"BBA"},10,"EvolutionPlot"]
Out[]=
In[]:=
MultiwaySystem[{"AA""","BA""ABB","BB""A"},{"BBA"},10,"StatesGraph"]
Out[]=
In[]:=
LayeredGraphPlot[%]
Out[]=
In[]:=
MultiwaySystem[{"AA""","BA""ABB","BB""A"},{"BBA"},10,"CausalGraph"]
Out[]=
In[]:=
MultiwaySystem[{"AA""","BA""ABB","BB""A"},{"BBA"},10,"CausalGraphStructure"]
Out[]=
In[]:=
LayeredGraphPlot[%60,AspectRatio1/2]
Out[]=
NKS note on formal languages
NKS note on formal languages
Regular Language
Regular Language
Example in text
Example in text
Confluence testing
Confluence testing
Enumeration of rules
Enumeration of rules
22
22
33
33
23
23
2->2, 2->2
2->2, 2->2
Causal Invariant Peel Off
Causal Invariant Peel Off
Weakly Confluent [converge only after arbitrary steps]
Weakly Confluent [converge only after arbitrary steps]
Given a pair of states, do they converge?
[unfinished]
[unfinished]
Showing Confluence Diamonds
Showing Confluence Diamonds