Question:
Which of the following languages are context-free?
Which of the following languages are context-free?
Show Hint
Context-free languages are closed under union, intersection with regular languages, and difference with regular languages.
Updated On: Feb 11, 2026
- L = {0^i1^j | i = j}
- L = {0^i1^j | i != j}
- L = {0^i1^j | i = 2j + 1}
- L = {0^i1^j | i = 2j}
Show Solution
Verified By Collegedunia
The Correct Option is D
Solution and Explanation
Context-free languages include those where the number of ‘0‘s and ‘1‘s are related in a balanced manner (e.g., (B), (D)). However, languages like (A) are not context free
Was this answer helpful?
0
0
Top CUET PG Data Science A.I Cyber Security and Computer Sci. Questions
- Match List I with List IIChoose the correct answer from the options given below:
LIST I LIST II (A) Circular Linked List (I) Recursive Function Calls (B) Doubly Linked List (II) Round Robin Queue in CPU (C) Stack (III) Hash Tables (D) Singly Linked List (IV) Undo and Redo Functionality - CUET (PG) - 2024
- Data Science A.I Cyber Security and Computer Sci.
- Programming and Data Structures
- In an HTTP request message, the first line is called:
- Typically, e-mail systems support five basic functions. Arrange them in sequence.
(A) Displaying
(B) Transfer
(C) Composition
(D) Disposition
(E) Reporting
Choose the correct answer from the options given below: - Deallocation of stack of thread and register contexts will take place.
- The following data fragment occurs in the middle of the data stream for which the byte stuffing algorithm is used: A B ESC C ESC FLAG ESC FLAG D. What is the output after stuffing?
View More Questions
Top CUET PG Theory of Computations Questions
- If L and L are recursively enumerable, then L is:
- CUET (PG) - 2024
- Data Science A.I Cyber Security and Computer Sci.
- Theory of Computations
- Let P be a regular language and Q be a context-free language such that Q ⊆ P. Then which of the following is always regular?
- CUET (PG) - 2024
- Data Science A.I Cyber Security and Computer Sci.
- Theory of Computations
- Finite Languages satisfy the pumping lemma by having n = .
- CUET (PG) - 2024
- Data Science A.I Cyber Security and Computer Sci.
- Theory of Computations
- Match List I with List II.
LIST I LIST II (A) Unification (I) Variable can be done with a constant, another variable, or a function. (B) Deep backtracking (II) The entire conjunctive goal is executed. (C) Forward movement (III) Choose subgoal with possible unifier. (D) Shallow backtracking (IV) Previous subgoal to find alternative solutions. - CUET (PG) - 2024
- Data Science A.I Cyber Security and Computer Sci.
- Theory of Computations
- Consider the FOL sentence F: ∀x(∃y R(x, y)). Assuming non-empty logical domains, which of the sentences below are implied by F?
(A) ∃y(∃x R(x, y))
(B) ∃y(∀x R(x, y))
(C) ∀y(∃x R(x, y))
(D) ¬∃x(∀y ¬R(x, y))
Choose the correct answer from the options given below:- CUET (PG) - 2024
- Data Science A.I Cyber Security and Computer Sci.
- Theory of Computations
Top CUET PG Questions
- What is the dilution factor of blood and RBC diluting fluid for a total erythrocyte count?
- CUET (PG) - 2026
- Cell Biology
- Which Harappan site is famous for its sophisticated water management system and a stadium?
- CUET (PG) - 2026
- Ancient Civilization
- The light pink colour of \([Co(H_2O)_6]^{2+}\) and the deep blue colour of \([CoCl_4]^{2-}\) are due to:
- CUET (PG) - 2026
- Coordination chemistry
- Which biochemical test identifies Streptococcus agalactiae via an enhanced hemolysis pattern?
- CUET (PG) - 2026
- Microbiology
- Which specific linkage makes cellulose unsuitable for human digestion?
- CUET (PG) - 2026
- Medical Terminology
View More Questions