604 views
0 votes
0 votes

Let L1 and L2 be 2 languages which are not regular. Which of these is true?

  1. The union of L1 and L2 is not regular.
  2. The intersection of L1 and L2 is not regular.
  1. Both I and II are true
  2. I is true, II is false
  3. I is false, II is true
  4. Both I and II are false

1 Answer

Best answer
4 votes
4 votes

Let L1=$a^nb^n$  and L2={$a^xb^y$ | x!=y}

1. L1 U L2

L=a*b* which is clearly a Regular Language. Hence I is False.

2. L1 ∩ L2:

L={} which is Regular Language. Hence II is False.

So, (D) Both I and II are False.

selected by

Related questions

0 votes
0 votes
0 answers
1
1 votes
1 votes
1 answer
4