Constructing Noneterministic Finite Automata (NFA) with a "not" condition I have a question about some theoretical CS. Particularly, designing an NFA diagram (nondeterministic finite automata) from some conditions.

I think I understand how to construct NFA's under most simple circumstances, however, the types that I am struggling with are not conditions. 

Here is one that has me really stumped:

&nbsp;

Σ = { a, b, c } 

Consider the language L:

L = { ω | ω ϵ Σ*, ω does not contain "cbac" }

&nbsp;

I'd like to use the lambda-transition (λ-transition) to simplify this a bit. I am struggling with. How do I consider this condition?

Any help would be greatly appreciated!
First construct the DFA which accepts any string that DOES contain "abaa".  Then interchange final vs non-final!  (note: this only works with a DFA, not an NFA)  The rest you have already figured out.