Question

1. Create an nfa for Σ = {a,b} that accepts the complement of the language defined by the following nfa:

states: {q0,q1}
input alphabet: {a,b}
initial state: q0
final states: {q1}
transitions:
δ(q0,b) = {q1}
δ(q0,λ) = {q1}
δ(q1,a) = {q0}

Answer 1

Here the NFA accepts string only with one b.

So complement of that language will accepts string with more than one b

If you have any questions comment down. Please don't simply downvote and leave. If you are satisfied with answer, please? upvote thanks