Suppose that \(L_1\) is a regular language and \(L_2\) is a context-free language. Which one of the following languages is NOT necessarily context-free?
Show Hint
- \(L_1 \cap L_2\)
- \(L_1 \cdot L_2\)
- \(L_1 - L_2\)
- \(L_1 \cup L_2\)
The Correct Option is C
Solution and Explanation
Step 1: Recall closure properties.
Context-free languages are closed under union and concatenation. They are also closed under intersection with regular languages.
Step 2: Analyze each option.
\(L_1 \cap L_2\) is context-free because CFLs are closed under intersection with regular languages.
\(L_1 \cdot L_2\) is context-free because CFLs are closed under concatenation.
\(L_1 \cup L_2\) is context-free due to closure under union.
Step 3: Examine set difference.
The language \(L_1 - L_2 = L_1 \cap \overline{L_2}\). Context-free languages are not closed under complementation. Hence, this operation does not guarantee a context-free language.
Step 4: Conclusion.
Therefore, \(L_1 - L_2\) is NOT necessarily context-free.
Final Answer: (C)
Top GATE CS Theory of Computation Questions
- Consider the following context-free grammar \(G\), where \(S\), \(A\), and \(B\) are the variables (non-terminals), \(a\) and \(b\) are the terminal symbols, \(S\) is the start variable, and the rules of \(G\) are described as:
\[ S \to aaB \mid Abb \] \[ A \to a \mid AaA \] \[ B \to b \mid bB \] Which ONE of the languages \(L(G)\) is accepted by \(G\)? - A regular language \(L\) is accepted by a non-deterministic finite automaton (NFA) with \(n\) states. Which of the following statement(s) is/are FALSE?
- Consider the following two languages over the alphabet \( \{a, b\} \): \[ L_1 = \{ \alpha \beta \alpha \mid \alpha \in \{a, b\}^+ { and } \beta \in \{a, b\}^+ \} \] \[ L_2 = \{ \alpha \beta \alpha \mid \alpha \in \{a\}^+ { and } \beta \in \{a, b\}^+ \} \] Which ONE of the following statements is CORRECT?
- Consider the following two languages over the alphabet \( \{a, b, c\} \), where \( m \) and \( n \) are natural numbers. \[ L_1 = \{ a^m b^{m+n} c^{m+n} \mid m, n \geq 1 \} \] \[ L_2 = \{ a^m b^n c^{m+n} \mid m, n \geq 1 \} \] Which ONE of the following statements is CORRECT?
Consider the following deterministic finite automaton (DFA) defined over the alphabet, \( \Sigma = \{a, b\} \). Identify which of the following language(s) is/are accepted by the given DFA.
Top GATE CS Questions
- Which of the following sequences when stored in an array at locations A[1],..., A[10] forms a max-heap?
- The Lucas sequence Ln is defined by the recurrence relation: Ln = Ln−1 + Ln−2, for n ≥ 3, with L1 = 1 and L2 = 3. Which one of the options given is TRUE?
- Which of the following fields of IP header is/are always modified by any router before it forwards to IP Packet ?
- Which one of the following CIDR profix exactly represent the range of IP addresses 10.12.2.0 to 10.12.3.255?
- Consider an ethernet segment whose transmission is \(10^8\) bits per second. Maximum segment length \(500\ m\), speed of the provocation media velocity is \(2 × 10^8\) meter per second. What is the minimum frame size in bits ?