3,148 views

3 Answers

Best answer
9 9 votes
  • ∅  U  ∅* = { } U {ϵ} = {ϵ}
  • ∅  $\cap$  ∅* = { } $\cap$ {ϵ}  = { } = ∅
  • ∅  U  ϵ* = { } U {ϵ} = {ϵ}
• selected by
1 1 vote
We know that,

 RE + ∅ = RE and ∅* = ϵ , RE is Regular expression

So from the given question

∅  U  ∅* which is nothing but  ∅  + ∅*

Therefore

∅  +  ϵ =  ϵ

Hence,  Option B is the correct answer. Correct me if iam Wrong.
Position:
Show:

Related questions

0 0 votes
0 0 answers
1.7k
1.7k views
sumit chakraborty asked Dec 5, 2017
1,744 views
Given transition for a $\epsilon$-NFA for p = $\delta (p,\epsilon ) = \left \{ q,r \right \}$ . The question asks for |$\epsilon$-closure(p)| = ? Given answer is 2 {q,r} ...
5 5 votes
1 1 answer
192
192 views
GO Classes asked Jul 2
192 views
Which of the following statements are correct?There exists a language $L$ such that $\epsilon \in L$ There exists a language $L$ such that $\epsilon \notin L$ $\emptyset ...
0 0 votes
1 1 answer
686
686 views
vaishali jhalani asked Nov 19, 2016
686 views
How to prove that a particular machine (FA,PDA,LBA) accepts empty language(φ)?
6 6 votes
4 answers 4 answers
12.0k
12.0k views