retagged by
11,828 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
retagged by

8 Answers

Best answer
38 votes
38 votes

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
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

29 votes
29 votes
3 answers
1
makhdoom ghaya asked Nov 27, 2016
5,825 views
Match the pairs in the following questions:$$\begin{array}{ll|ll}\hline \text{(A)} & \text{Base addressing} & \text{(p)} & \text{Reentranecy} \\\hline \text{(B)} & \text...
26 votes
26 votes
2 answers
2
4 votes
4 votes
1 answer
3
makhdoom ghaya asked Nov 29, 2016
1,876 views
Compute the postfix equivalent of the following infix arithmetic expression$a + b \ast c + d * e \uparrow f$where $\uparrow$ represents exponentiation. Assume normal ope...