Recent questions tagged epsilon-nfa

Select the equivalent regular expression for the given $\epsilon$-NFA.$(01)^*1(01)$  $(0+1)^*1(0+1)$  $((0+1)^*+1)(0+1)$  $(01)^*+1+(01)$

Which of the following is true?A language $L$ is accepted by DFA iff it is accepted by some $\epsilon$-NFA. A language $L$ is accepted by $\epsilon$-NFA iff it is accepte...

This $\epsilon$-NFA accepts which language?$1(01)^*$  $1(01)^* + 1(0+1)^*1$  $1(01)^* + 1(0+1)^*$ None of these

What is $\epsilon$-closure of $q_1$ in the given $\epsilon$-NFA?$\{q_0\}$ $\{q_0,q_1,q_2\}$ $\{q_0,q_2\}$ $\{q_0,q_1\}$

Which of the following strings will not be accepted by the given $\epsilon$-NFA?$\text{abababa}$ $\text{aaaaaaa}$ $\text{ababab}$ $\text{baaa}$

The domain and codomain for the transition function for $\epsilon$-NFA is given by $\_\_\_\_\_\_\_\_$, where $Q$ is a finite set of states and $\Sigma$ is a finite input ...

The set of reachable state(s) for the string $1101$ for the below NFA is:$\{q_0, q_1\}$ $\{q_1, q_3\}$ $\{q_3\}$ $\{q_2, q_1, q_3\}$

What is the language accepted by the following NFA?The set of strings containing $baba$ as substring The set of strings ending with $abab$ The set of strings beginning wi...

What is the set of final states in the following NFA?$\{q_2, q_4\}$ $\{q_1, q_2, q_3, q_4\}$ $\{q_0,q_1,q_2, q_3, q_4\}$ $\{q_1, q_3, q_4\}$