Construction of sequences of zeros and ones with complex finite sequences

We construct infinite sequences of zeros and ones under some restrictions (not to contain subwords of some definite type or definite bits at definite positions or so on). This paper concerns probabilistic methods of constructing such sequences with application of Lovasz Local Lemma and their Kolmogorov complexity reformulation.