Login
Register
Dark Mode
Brightness
Ambient Glow – Questions list
Register
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged context-free-language
4
4 votes
2
2 answers
174
174 views
GO Classes DPP | GATE CS | Theory of Computation | Language of CFG
Consider the CFG$$\begin{aligned}S &\to VS \mid cT \\T &\to VT \mid cU \\U &\to \epsilon \mid VU \\V &\to a \mid b\end{aligned} $$Which language is generated by this gram...
GO Classes
174
views
asked
Sep 1
Theory of Computation
goclasses
goclasses-cs-dpp
theory-of-computation
goclasses-cs-dpp-day-361
goclasses-toc-practice-questions
context-free-grammar
context-free-language
+
–
2
2 votes
1
1 answer
100
100 views
GO Classes DPP | GATE CS | Theory of Computation | Union of CFLs
Which CFG generates the language $L = \{a^m b^n \mid 2m=n \text{ or } m=2n\}$?$S \to aSbb \mid aaSb \mid \epsilon$ $S \to X \mid Y$$X \to aXbb \mid \epsilon$$Y \to aaYb \...
GO Classes
100
views
asked
Sep 1
Theory of Computation
goclasses
goclasses-cs-dpp
theory-of-computation
goclasses-cs-dpp-day-361
goclasses-toc-practice-questions
context-free-grammar
context-free-language
+
–
0
0 votes
0
0 answers
141
141 views
intersection of a context free language and a regular language
The intersection of a context free language and a regular languagea)need not be regularb)need not be context freec) is always regulard) is always context free
lambodar_pal
141
views
asked
Jul 27
Theory of Computation
closure-property
theory-of-computation
context-free-language
regular-language
+
–
1
1 vote
1
1 answer
111
111 views
UGC NET CSE | December 2025 | Part 2 | Question: 56
Which of the following languages cannot be accepted by push down automata?$\mathrm{L}=\left\{\mathrm{a}^\mathrm{n} \mathrm{b}^{n} c^\mathrm{n}: \mathrm{n} \geq 0\right\}$...
Shubham Sharma 2
111
views
asked
Apr 19
Theory of Computation
ugcnetcse-dec2025
theory-of-computation
pushdown-automata
context-free-language
identify-class-language
+
–
8
8 votes
3
3 answers
2.1k
2.1k views
GATE CSE 2026 | Set 2 | Question: 38
Let $\Sigma=\{a, b, c, d\}$ and let $L=\left\{a^{i} b^{j} c^{k} d^{\ell} \mid i, j, k, \ell \geq 0\right\}$.Which of the following constraints ensure(s) that the language...
gatecse
2.1k
views
asked
Feb 23
Theory of Computation
gatecse-2026-set2
theory-of-computation
context-free-language
multiple-selects
two-marks
+
–
13
13 votes
4
4 answers
1.6k
1.6k views
GATE CSE 2026 | Set 1 | Question: 42
Consider the following context-free grammar $G$.\[\begin{array}{l}S \rightarrow a b a A B A b b a \\A \rightarrow a a B B A b \mid b B a b a a \\B \rightarrow a B b \mid ...
gatecse
1.6k
views
asked
Feb 23
Theory of Computation
gatecse-2026-set1
theory-of-computation
context-free-language
two-marks
multiple-selects
+
–
0
0 votes
0
0 answers
472
472 views
Test Series
$$L = \{\, a^{n} b^{m} c^{k} \mid n,m,k 0 \text{ and } k = |n-m| \,\}$$Is it dcfl or cfl ?my approachWe can split the condition \(k = |n - m|\) into two cases:Case 1:\(n...
JHighlight
472
views
asked
Sep 23, 2025
Theory of Computation
theory-of-computation
pushdown-automata
context-free-language
+
–
0
0 votes
0
0 answers
259
259 views
UGC NET CSE | June 2025 | Part 2 | Question: 72
Which of the following Grammars is/are only Context Free?$\begin{array}{|l|l|l|l|} \hline \textbf{I} & \begin{array}{l} S \rightarrow A b \\ a S \rightarrow a A \\ A \ri...
Shubham Sharma 2
259
views
asked
Sep 10, 2025
Theory of Computation
ugcnetcse-june2025
theory-of-computation
grammar
context-free-grammar
context-free-language
+
–
5
5 votes
2
2 answers
474
474 views
GO Classes | CSE Course | Theory Of Computation
Consider the following CFG $G$ over $\Sigma = \{\mathbf{a},\mathbf{b},\mathbf{c},\mathbf{d}\}$:\[\begin{array}{rcl}S & \rightarrow & S\mathbf{a} \;\mid\; \mathbf{d}T \\T ...
GO Classes
474
views
asked
Sep 9, 2025
Theory of Computation
theory-of-computation
context-free-grammar
context-free-language
goclasses
+
–
0
0 votes
0
0 answers
225
225 views
UGC NET CSE | August 2024 | Part 2 | Question: 3
If $L_{1}$ and $L_{2}$ are context free languages, which of the following is True about $L_{1} \cap L_{2}$?$\mathrm{L}_{1} \cap \mathrm{~L}_{2}$ is context free$\mathrm{L...
Shubham Sharma 2
225
views
asked
Sep 9, 2025
Theory of Computation
ugcnetcse-aug2024
theory-of-computation
context-free-language
context-sensitive
recursively-enumerable-languages
+
–
0
0 votes
0
0 answers
165
165 views
UGC NET CSE | August 2024 | Part 2 | Question: 52
Arrange the following Language Classes in ascending order according to their expressive power, as defined by Chomsky hierarchy:Context-free languagesContext-sensitive lan...
Shubham Sharma 2
165
views
asked
Sep 9, 2025
Theory of Computation
ugcnetcse-aug2024
grammar
context-free-language
context-sensitive
regular-language
theory-of-computation
+
–
1
1 vote
1
1 answer
205
205 views
UGC NET CSE | August 2024 | Part 2 | Question: 56
Which of the following are context free language?$\left\{\mathrm{w}^{\mathrm{i}} \mathrm{x}^{\mathrm{j}} \mathrm{y}^{\mathrm{k}} \mathrm{z}^{l} \mid \mathrm{i}+\mathrm{k}...
Shubham Sharma 2
205
views
asked
Sep 9, 2025
Theory of Computation
ugcnetcse-aug2024
theory-of-computation
context-free-language
grammar
+
–
0
0 votes
1
1 answer
245
245 views
UGC NET CSE | December 2023 | Part 2 | Question: 22
Let $\text{A}=\{a, b\}$ and $\text{L}=\text{A}^{*}$. Let $x=\left\{a^{n} b^{n}, n>0\right\}$. The languages $\text{L} \cup \text{X}$ and $\text{X}$ are respectively :Not ...
Shubham Sharma 2
245
views
asked
Sep 9, 2025
Theory of Computation
ugcnetcse-dec2023
regular-language
context-free-language
theory-of-computation
+
–
1
1 vote
2
answers
2 answers
703
703 views
Grammar for {a^nb^mc^p | n ≠ m or m ≠ p}
Is {aⁿbᵐcᵖ | n ≠ m or m ≠ p} CFL? If so what is the Context Free Grammar for it? If not, what is the grammar for the language?
ace0-0
703
views
asked
Aug 31, 2025
Theory of Computation
theory-of-computation
context-free-language
context-free-grammar
grammar
+
–
18
18 votes
3
3 answers
7.0k
7.0k views
GATE CSE 2025 | Set 1 | Question: 35
Consider the following two languages over the alphabet $\{a, b, c\}$, where $m$ and $n$ are natural numbers.$$\begin{aligned} L_{1} & =\left\{a^{m} b^{m} c^{m+n} \mid m, ...
Arjun
7.0k
views
asked
Feb 27, 2025
Theory of Computation
gatecse2025-set1
theory-of-computation
context-free-language
two-marks
+
–
2
2 votes
1
answers
1 answer
681
681 views
Self Doubt and important observation
Is the language $L = \{ 0^n1^n0^n | n >= 0 \text{ and n is even }\}$ a cfl ?I know if the n is even constraint is not added L is not a cflBut if n is even the language is...
angryclawz
681
views
asked
Dec 29, 2024
Theory of Computation
context-free-language
pumping-lemma
+
–
1
1 vote
1
1 answer
755
755 views
Closure properties (Theory of computation)
Can anyone help me to understand what's wrong with my solution??
Satya_Uday_Bandaru
755
views
asked
Dec 11, 2024
Theory of Computation
theory-of-computation
closure-property
context-free-language
regular-language
context-sensitive
+
–
1
1 vote
0
0 answers
676
676 views
Given a language, categorize it in either: regular, context-free but not regular, and not context free.
Please help for 1a), b) and c), thank you
dispatch
676
views
asked
Nov 26, 2024
Theory of Computation
pushdown-automata
theory-of-computation
regular-language
context-free-language
pumping-lemma
+
–
3
3 votes
0
0 answers
382
382 views
Peter Linz Edition 6 Exercise 7.3 Question 14 (Page No. 207)
Show that $L = \{a^nb^m,n< 2m \}$ is a deterministic context-free language.
Deepak Poonia
382
views
asked
Nov 20, 2024
Theory of Computation
theory-of-computation
peter-linz
context-free-language
dpda
dcfl
pushdown-automata
+
–
1
1 vote
1
1 answer
585
585 views
CMI2023-B: 1
Let $\Sigma=\{a, b\}$ be an alphabet. A palindrome is a word which reads the same when read from left-to-right, or from right-to-left. For example, the words $a b b a, a ...
admin
585
views
asked
Nov 13, 2024
Theory of Computation
cmi2023
theory-of-computation
regular-language
context-free-language
grammar
+
–
0
0 votes
1
1 answer
218
218 views
CMI2023-A: 7
Let $L$ be a regular language, and let $n=10$. Which of the following statements is true?$L \cup\left\{a^{n} b^{n}\right\}$ is regular$L \cup\left\{a^{n} b^{n}\right\}$ i...
admin
218
views
asked
Nov 13, 2024
Theory of Computation
cmi2023
regular-language
context-free-language
union
theory-of-computation
+
–
1
1 vote
3
3 answers
886
886 views
ISRO CSE 2023 | Question: 56
Which f the following statements is FALSE?The intersection of a regular language and a context-free language is context=freeThe intersection of a regular language and con...
admin
886
views
asked
Sep 28, 2024
Theory of Computation
isro-cse-2023
theory-of-computation
context-free-language
regular-language
+
–
2
2 votes
1
answers
1 answer
634
634 views
Decidability/Undecidability Question on CGF
Which of the following language is/are Turing decidable? 1. L = { <G1, G2 | G1 & G2 are regular grammar and L(G1) ⊆ L(G2)} 2. L = { <G, R | G is a CFG & R is a regular ex...
aftab0711
634
views
asked
Aug 27, 2024
Theory of Computation
theory-of-computation
decidability
context-free-grammar
context-free-language
+
–
0
0 votes
1
1 answer
502
502 views
Regular Expression
Is this language regular or not?xww^R | x,w E (a,b)*
navaneethsaj
502
views
asked
Jun 26, 2024
Theory of Computation
regular-language
context-free-language
context-sensitive
+
–
1
1 vote
0
0 answers
427
427 views
Context Free language sample question
Give a context-free grammar for each of the following languages. Consider, Σ={0,1}.A. The language of strings that start with 1B. The language of strings of the form WWR ...
dazeeee
427
views
asked
Apr 3, 2024
Theory of Computation
theory-of-computation
finite-automata
context-free-language
+
–
0
0 votes
0
0 answers
312
312 views
#toc
Çșȇ ʛấẗẻ
312
views
asked
Feb 24, 2024
Theory of Computation
theory-of-computation
finite-automata
regular-expression
regular-language
context-free-language
+
–
Page:
1
2
3
4
5
6
...
23
next »