3,319 views
2 votes
2 votes

Construct an eqv. NFA for the given ∈-NFA

Is this eqv. Nfa correct??

Or this one

Why is thr transition between q0 to q1 of 0,1 ?

1 Answer

Best answer
4 votes
4 votes

$\epsilon$- closure $(q_0)=(q_0,q_1,q_2)$

$\epsilon$-closure$(q_1)=(q_1,q_2)$

$\epsilon$-closure$(q_2)=(q_2)$

We can design DFA directly by taking $\epsilon$- closure $(q_0)$ , i,e, $(q_0,q_1,q_2)$ as start state

$Q$\ $\Sigma$ $0$ $1$ $2$
->$(q_0,q_1,q_2)^*$ $(q_0,q_1,q_2)$ $(q_1,q_2)$ $(q_2)$
$(q_1,q_2)^*$ - $(q_1,q_2)$ $(q_2)$
$(q_2)^*$ - - $(q_2)$
- - - -

or NFA with q0 as start state and having states $q_0, q_1$ and $q_2$ where $q_2$ is final state

$Q$\ $\Sigma$ $0$ $1$ $2$
->$q_0$ $q_0,q_1,q_2$ $q_1,q_2$ $q_2$
$q_1$ - $q_1,q_2$ $q_2$
$q_2^*$ - - $q_2$

And from NFA we can convert to DFA also 

selected by

Related questions

4 votes
4 votes
1 answer
2
Garrett McClure asked Oct 9, 2017
1,253 views
The tail of a language is the set of all suffixes of its strings, that is tail(L) = {y : xy ∈ L for some x ∈ Σ ∗ }.How do I show that the family of regular languag...
0 votes
0 votes
1 answer
4
aditi19 asked Dec 14, 2018
1,334 views
convert the following NFA to DFA