1,562 views
1 votes
1 votes

Consider the language L1 = ε  and L2 = {a}. Which one of the following
represents L1L2*UL1* ?
(A) { ε }    (B)  Φ
(C) a*       (D) {  ε , a}

1 Answer

Best answer
3 votes
3 votes

L1 (L2)* U L1*
 L1 = ε, L2 = {a}
= ε a* U ε
=a* U ε
=a*
​​​​​​​option C

selected by
Answer:

Related questions

0 votes
0 votes
0 answers
1
Sandeep Verma asked Nov 13, 2017
318 views
If a language(L1) is Recursive (REC) and L2 is Recursive (REC) , then what will be L1-L2 ?
3 votes
3 votes
2 answers
2
Sandeep Verma asked Nov 12, 2017
2,174 views
If a language(L1) is Recursive enumerable (RE) and L2 is Recursive (REC) , then what will be L1 - L2 ? Can we directly use set difference property or do the s...
5 votes
5 votes
4 answers
4
Purple asked Jan 28, 2016
8,742 views
Consider L1, L2 ⊆ Ʃ* such that L1 and L1 ∪ L2 are regular.(a) L2 is definitely regular(b) L2 may not be regular(c) L2 is context free(d) None of aboveIs it option B ...