How would I design an NFA that recognises the language of all strings that don't end in a certain sequence? How would I design an NFA that accepts all strings don't end in a certain sequence over the alphabet {0,1}.
Designing a DFA that does the job is fairly straight forward, but I can't find out how to make my Automata Non-Deterministic.
Any DFA is also already a NFA, so you've already answered your question.