A regular expression, without much rigor, is a very compact way of representing several different strings. Given a regular expression (regex), can I find out all the strings the regex can find?
⎕←⎕ucs 2∘⊥∘⌽¨ ↓7 (⊢⍴⍨⊣,⍨÷⍨∘≢) ⍎¨ '0001011001011100101110000111110', '0111010111011110101111010101101', '1100001100101110001011110011100', '0011100001110111010110001111110111011011'