title: Regular expression to get a strings depending on the length of a substring
body: <p>Can you please suggest if it possible and how to define regular expression for the next problem:</p>
  <p>I have 2 'binary' strings joined by a delimiter. Let's say the delimiter is always 3.</p>
  <p>Example of input data:</p>
  <pre><code>11000031000111011001101111
  0111000301000111011001101111
  001310001110110011011110
  </code></pre>
  <p>On the right part of the delimiter, I need to select all '1+' blobs, but I don't want to select 1+ blobs with length equal to 1+ blobs on the left part of the delimiter.</p>
  <p>So for example on this input:</p>
  <pre><code>11000031000111011001101111
  </code></pre>
  <p>There are these 1+ blobs:</p>
  <pre><code>left: 11
  right: 1, 111, 11, 11, 1111
  </code></pre>
  <p>I would need to select all right 1+ blobs, but the '11', since those are also present on the left.</p>
  <p>So on that example I would need to match: <code>1,111,1111</code></p>
  <p>Other examples:</p>
  <pre><code>0111000301000111011001101111 ==&gt; 1,11,11,1111
  001310001110110011011110     ==&gt; 111,11,11,1111
  </code></pre>
  <p>I also need to have location of each string (Match Object). It is important to understand complexity of this task and if it is possible to construct FSM. What if limit the size of left part (for example &lt; 8)</p>