recategorized by
938 views
1 votes
1 votes

$\left (0+ \varepsilon \right) \left (1+ \varepsilon \right)$ represents :

  1. $\left \{0,1,01,\varepsilon  \right \}$
  2. $\left \{0,1,\varepsilon  \right \}$
  3. $\left \{0,1,01, 11, 00 ,10,\varepsilon  \right \}$
  4. $\left \{0,1,  \right \}$
recategorized by

2 Answers

1 votes
1 votes

$\epsilon.SOMETHING=SOMETHING$

$\epsilon.\epsilon=\epsilon$

OPTION A

$(0+\epsilon)(1+\epsilon)$

=  $0.1+0.\epsilon+\epsilon.1+\epsilon\epsilon$

=  $01,0,1,\epsilon$

=  $\left \{ 0,1,O1,\epsilon \right \}$

Answer:

Related questions

1 votes
1 votes
1 answer
1
admin asked Mar 31, 2020
1,217 views
Let $P, Q, R$ be a regular expression over $\Sigma$. If $P$ does not contain null string, then $R=Q+RP$ has a unique solution ___________ .$Q^{*}P$$QP^{*}$$Q^{*}P^{*}$$\l...
2 votes
2 votes
1 answer
2
2 votes
2 votes
4 answers
3
admin asked Mar 31, 2020
1,631 views
The automaton which allows transformation to a new state without consuming any input symbols : $NFA$$DFA$$NFA - 1$All of the options
2 votes
2 votes
3 answers
4
admin asked Mar 31, 2020
1,572 views
Complement of a $DFA$ can be obtained by :making starting state as final state.make final as a starting state.making final states non-final and non-final as final.None of...