A regular expression question
        Posted  
        
            by Hellnar
        on Stack Overflow
        
        See other posts from Stack Overflow
        
            or by Hellnar
        
        
        
        Published on 2010-05-12T10:49:46Z
        Indexed on 
            2010/05/12
            10:54 UTC
        
        
        Read the original article
        Hit count: 205
        
Hello, I am in dire need of a such regular expression where my alphabet is made up of 0s and 1s.
Now I need a language that accepts all words as long as it has three 0s.
IE:
000 10001 0001 1000 10000101
© Stack Overflow or respective owner