User blog:Ubersketch/PrSS in my FSS definition

Primitive Sequence System is an ordered 3-tuple (O, F, a[n]) such that:
 * (empty string) = 0 is in O
 * f(a) is in O if a is in O and f(a) is in F
 * a,0 = S(a)
 * f(a) is in F if and only if
 * f(a) = a(0) or
 * f(a,n+m) = f(a,n+m,n) or
 * f(a) = g(h(a)) where g(a) and h(a) are in F
 * A sequence is either
 * (empty string) or
 * a,b,c... where a, b, c... are natural numbers and are called entries.
 * a_0 is x in a = x# where # is any string
 * a_n+1 is x in #a_n,x# where #s are any strings
 * L_a is entry a_n such that for all a_m, m>n where #s are many strings
 * BR_a is entry a_n such that n is largest natural number such that a_n < L_a
 * G_a are all a_n such that n>m where BR_a = a_m
 * a - b = ## where a = #b# where a and b are sequences and #s are any strings.
 * B_a = a-L_a-G_a
 * + denotres concatenation
 * a[n] = BR_a+BR_a+BR_a... with n BR_a+