The language is $\{w \mid \text{$w$ is any string except $11$ and $111$}\}$ where the alphabet is $\{0,1\}$.Drawing the DFA recognizing $\{v \mid \text{$v$ is either $11$ or $111$}\}$, then switching the accept and non-accept states, and finally examining this resulting structure, I thought of it as being:$(0^*110^*110^*111^+)$My reasoning was that it has to accept the empty string,or a 0 followed by whateveror just a $1$or, if it begins with a $1$, a $10$ followed by whateveror, if it begins with $11$, then a $110$ followed by whateveror a $111$ followed by at least a $0$ or a $1$Does this appear to be correct? If I'm wrong, could you please tell me why?Thank you, 
What is the regular expression describing this language?
finite automata;regular expressions