354 views
1 votes
1 votes

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?

1 Answer

Related questions

2 votes
2 votes
0 answers
2
Naveen Kumar 3 asked Mar 30, 2019
456 views
Give a simple verbal description of the language accepted by the dfa in following figure.Use this to find another dfa, equivalent to the given one, but with fewer states....