A generating function for bit strings with no Grand Dyck pattern matching

We study the construction and the enumeration of bit strings, or binary words, having more 1's than 0's and avoiding a set of Grand Dyck patterns which form a cross-bifix-free set. We give a particular jumping and marked succession rule which describes the growth of such words according to the number of 1's. Then, we give the enumeration of the class by means of generating function.