4,577 views
2 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 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
Position:
Show:

Related questions

4 4 votes
1 1 answer
1.6k
1.6k views
Garrett McClure asked Oct 9, 2017
1,601 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 languages is c...
2 2 votes
1 1 answer
100
100 views
GO Classes asked Sep 5
100 views
Consider the NFA given below: Which right-linear grammar is obtained by the standard NFA-to-grammar construction?$q_0 \to aq_1$,$q_1 \to aq_0 \mid bq_1 \mid \epsilon$ $q_...
1 1 vote
1 1 answer
116
116 views
GO Classes asked Sep 5
116 views
Consider the right-linear grammar,$$\begin{aligned}S &\to aB \mid bS \mid \epsilon \\B &\to aS \mid bB\end{aligned}$$Which NFA is obtained by the standard grammar-to-NFA ...