434 views

2 Answers

0 votes
0 votes
If L1 U L2 is regular and L1 is regular, then we cannot conclude that L2 is also regular.

Let L1 U L2= ∑* and L1 = ∑*
Then L2 ={ aⁿbⁿ |n>=0} is not regular and L1 U L2 is regular.
0 votes
0 votes
if L1 is regular and L1 U L2 is regular then we cannot conclude that L2 is regular ,

 L1=(a+b)* ,  L2={a^n b^n |n>0}    L1 U L2 = (a+b)*

Related questions

451
views
2 answers
0 votes
Naveen Kumar 3 asked Apr 12, 2019
451 views
Is the family of regular languages closed under infinite intersection?
227
views
0 answers
0 votes
Naveen Kumar 3 asked Apr 12, 2019
227 views
Consider the argument that the language associated with any generalized transition graph is regular. The language associated with such a graph is ... case, because of the special nature of $P$, the infinite union is regular.
232
views
0 answers
0 votes
Naveen Kumar 3 asked Apr 12, 2019
232 views
Let $P$ be an infinite but countable set, and associate with each $p ∈ P$ a language $L_p$. The smallest set containing every $L_p$ is the union ... . Show by example that the family of regular languages is not closed under infinite union.
229
views
0 answers
0 votes
Naveen Kumar 3 asked Apr 5, 2019
229 views
Define the operation $leftside$ on $L$ by $leftside(L)=$ {$w:ww^R∈L$}Is the family of regular languages closed under this operation?