Peter Linz Edition 4 Exercise 2.3 Question 1 (Page No. 62)

Question

Theorem: Let $L$ be the language accepted by a nondeterministic finite accepter $M_N= (Q_N, Σ,δ N,q0,F_N)$. Then
there exists a deterministic finite accepter $M_D= (Q_D, Σ,δ_D,${$q_0$}$,F_D)$ such that
$L= L (M_D)$.

convert the nfa in following figure to a dfa:

Can you see a simpler answer more directly?

Comments

this NFA accepting a+

Answer 1

2 states are required foe dfa