edited by
7,343 views

3 Answers

Best answer
21 votes
21 votes

Context free languages are not closed under intersection and complement. Correct option is (B) Union and Kleene closure.

edited by
1 votes
1 votes
CFLs are not closed under intersection, complement and set difference. Hence, the correct option is (B).
Answer:

Related questions

34 votes
34 votes
2 answers
1
Kathleen asked Sep 23, 2014
5,007 views
Show that the language $$L = \left\{ xcx \mid x \in \left\{0,1\right\}^* \text{ and }c\text{ is a terminal symbol}\right\}$$ is not context free. $c$ is not $0$ or $1$.
46 votes
46 votes
2 answers
2
Kathleen asked Sep 23, 2014
24,995 views
Consider the regular expression $(0 + 1) (0+1) \dots N$ times. The minimum state finite automaton that recognizes the language represented by this regular expression cont...
25 votes
25 votes
1 answer
3
Kathleen asked Sep 23, 2014
4,009 views
Let $R = (A, B, C, D, E, F)$ be a relation scheme with the following dependencies $C \rightarrow F, E \rightarrow A, EC \rightarrow D, A \rightarrow B $. Which one of the...
38 votes
38 votes
1 answer
4
Kathleen asked Sep 23, 2014
16,787 views
Consider the join of a relation $R$ with a relation $S$. If $R$ has $m$ tuples and $S$ has $n$ tuples then the maximum and minimum sizes of the join respectively are$m+n$...