in Theory of Computation edited by
2,584 views
3 votes
3 votes

Given the following statements:

  1. A class of languages that is closed under union and complementation has to be closed under intersection
  2. A class of languages that is closed under union and intersection has to be closed under complementation

Which of the following options is correct?

  1. Both (i) and (ii) are  false
  2. Both (i) and (ii) are true
  3. (i) is true, (ii) is false
  4. (i) is false, (ii) is true
in Theory of Computation edited by
2.6k views

1 comment

A intersection  B  = (A'UB')'  . since set is closed under complement and union   so it must be closed  under intersection  so a is true  ( union and complement-> intersection

no such relation between union , intersection  --> complementation
0
0

7 Answers

0 votes
0 votes

FIRST STATEMENT IS TRUE

REGULER,CSL,RECURSIVE  CLOSED UNDER UNION AND COMPLEMENTATION  AND THESE ARE  ALSO CLOSED UNDER INTERSECTION

SECOND STATEMENT IS FALSE

RE  CLOSED UNDER UNION AND INTERSECTION HAS  BUT NOT CLOSED UNDER COMPLEMENTATION

 

0 votes
0 votes
Option C) is correct.
0 votes
0 votes

L1 $\cup$ ~(L2) = L1 $\cap$ L2

here we can tell about intersection using union and complementation. but we can’t tell about complementation using union and intersection.

hence C is correct option.

 

Answer:

Related questions