Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- from random import *
- p1 = 0.750000
- p2 = 0.250000
- m = 0
- Axiom: _(1)[f(50)+90f(10)]-(90)P(1,0)
- derivation length: 60
- # A = branching state
- # B = non-branching state
- def Start():
- global m
- m = 0
- production:
- P(x,t) :
- if t <= 1 : produce T[G(x)]+(180)P(x,t+1)
- else :
- global m
- m = 1
- produce *
- G(x) :
- if m==1 :
- produce +(90)S(x)
- S(x) :
- if random() <= 0.5: produce A(x)
- else: produce B(x)
- A(x) :
- if random() <= p1: produce I[M(x)]A(1-x)
- else: produce I B(1-x)
- B(x) :
- if random() <= p2: produce IB(1-x)
- else: produce I[M(x)]A(1-x)
- homomorphism:
- T : produce ;(1)f(0);(1)@c(1)
- M(x) :
- if x==0 : produce ;(2)+F(0)
- elif x==1 : produce ;(2)-F(0)
- I : produce ;(1)F(2)
- endlsystem
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement