Thus, every CSG has a unique binary encoding and also note that given any such binary encoding there is at most one CSG corresponding to it.
Consider a canonical ordering on {0, 1}*.
A string 
may not be an encoding of a CSG i.e. may not define a CSG. If wi a valid encoding of CSG, then call it Gi
Define a language
L = { wi | wi define a CSG Gi and wi 
L(Gi)}