Regular Expression

Posted by equilibrium on Stack Overflow See other posts from Stack Overflow or by equilibrium
Published on 2010-04-17T09:53:10Z Indexed on 2010/04/17 10:03 UTC
Read the original article Hit count: 168

Filed under:
|
|
|

Ohh! this regular expression thing is eating my brain up. I have been reading it from Introduction to Automata Theory, Languages and Computer by Hopcroft, Motwani and Ullman.

I have solved a few exercises too but could not solve the following even after trying for almost one hr.

The problem is to write a regular expression that defines a language consisting of all strings of 0s and 1s except the substring 011.

Is the answer (0+1)* - 011 correct ? If not what should be the correct answer for this?

© Stack Overflow or respective owner

Related posts about regex

Related posts about homework