in Theory of Computation retagged by
11,858 views
32 votes
32 votes

Context-free languages and regular languages are both closed under the operation (s) of :

  1. Union
  2. Intersection
  3. Concatenation
  4. Complementation
in Theory of Computation retagged by
11.9k views

1 comment

edited by

$\color{red}{\text{Find Detailed Video Solution Below}}$ $\color{BLACK}{\text{  , With Proof of each option:}}$

https://youtu.be/bz2b4XNjsWY

10
10

8 Answers

38 votes
38 votes
Best answer

Answer: (A) and (C)

Regular language is closed under Union, Intersection, Concatenation, and Complementation.

CFL is closed under  Union Concatenation but not under Intersection or Complementation.

So, both closed under Union  Concatenation.

edited by

1 comment

can you tell me example of " intersection of 2 regular language "??
1
1
8 votes
8 votes

CFL is not closed under Intersection, complementation and set difference.
 

Property Regular language CFL
Union Closed Closed
Intersection Closed No
Set Difference Closed No
Complementation Closed No
Intersection with a regular lang. Closed Closed
Concatenation Closed Closed

so Ans : Context-free languages and regular languages are both closed under Union and concatenation

4 votes
4 votes

Context-free languages and regular languages are both closed under the operation (s) of 
 

  1. Union
  2. Concatenation
0 votes
0 votes
Regular languages closed under Union, Intersection, Concatenation and Complementation but CFC is only closed under Union and Concatenation.
Hence both A and C
Answer:

Related questions