Login
Register
Dark Mode
Brightness
Ambient Glow – Questions list
Register
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged context-sensitive
0
0 votes
1
1 answer
90
90 views
UGC NET CSE | December 2025 | Part 2 | Question: 52
Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason RAssertion A: $L=\left\{a^{n} b^{n} c^{n}: n \geq 0\right\}$ is accepte...
Shubham Sharma 2
90
views
asked
Apr 19
Theory of Computation
ugcnetcse-dec2025
theory-of-computation
context-sensitive
linear-bounded-automata
grammar
+
–
0
0 votes
2
2 answers
328
328 views
UGC NET CSE | January 2025 | Part 2 | Question: 70
Match the $\textbf{LIST-I}$ with $\textbf{LIST-II}$$\begin{array}{|l|l|l|l|} \hline & \textbf{ LIST-I } & & \textbf{ LIST-II } \\ \hline \text{A.} & \text{Type} - 0 \text...
Shubham Sharma 2
328
views
asked
Sep 10, 2025
Theory of Computation
ugcnetcse-jan2025
theory-of-computation
grammar
context-sensitive
context-free-grammar
regular-grammar
+
–
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
163
163 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
163
views
asked
Sep 9, 2025
Theory of Computation
ugcnetcse-aug2024
grammar
context-free-language
context-sensitive
regular-language
theory-of-computation
+
–
2
2 votes
1
1 answer
449
449 views
are context sensitive languages closed under set difference?
Souvik00
449
views
asked
Dec 20, 2024
Theory of Computation
theory-of-computation
closure-property
context-sensitive
context-sensitive-languages
+
–
1
1 vote
1
1 answer
754
754 views
Closure properties (Theory of computation)
Can anyone help me to understand what's wrong with my solution??
Satya_Uday_Bandaru
754
views
asked
Dec 11, 2024
Theory of Computation
theory-of-computation
closure-property
context-free-language
regular-language
context-sensitive
+
–
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
+
–
3
3 votes
2
2 answers
1.1k
1.1k views
TOC - Self Doubt
Can anyone explain $\overline{ww}$ is $CFL$ or $CSL$ And if $CFL$ can you write the equivalent $CFG$ for this ?
Jiten008
1.1k
views
asked
Oct 24, 2023
Theory of Computation
pushdown-automata
theory-of-computation
self-doubt
regular-language
context-free-language
context-sensitive
turing-machine
closure-property
context-free-grammar
+
–
0
0 votes
0
0 answers
571
571 views
Is it CFL or CSL?
Is {$a^nb^nc^n$ | $n>=0$} CSL? After comparing both a and b, stack would be empty. So it can’t be CFL. So it is CSL or recursive. And does this language require more than...
h4kr
571
views
asked
Dec 23, 2022
Theory of Computation
theory-of-computation
context-free-language
context-sensitive
pushdown-automata
+
–
1
1 vote
2
answers
2 answers
1.8k
1.8k views
Is it also CSL?
Is the following Language, L = {xxxx | x ∈ {0, 1}*} CSL or not? I saw a explanation say that it’s REC, but it didn’t say anything about it not being CSL and I used to thi...
h4kr
1.8k
views
asked
Dec 18, 2022
Theory of Computation
theory-of-computation
context-sensitive
recursive-and-recursively-enumerable-languages
+
–
0
0 votes
2
2 answers
1.7k
1.7k views
Theory of Computation | Automata
L= {$a^nb^nc^nd^n; n\geq 0$} Given Language is a CSLTRUEFALSE
Souvik33
1.7k
views
asked
Dec 12, 2022
Theory of Computation
theory-of-computation
context-sensitive
+
–
0
0 votes
1
answers
1 answer
1.4k
1.4k views
ace academy ToC
I don’t get the explanation, How do you categorize grammer on the basis of production?
h4kr
1.4k
views
asked
Dec 4, 2022
Theory of Computation
theory-of-computation
context-sensitive
grammar
ace-test-series
+
–
0
0 votes
2
2 answers
983
983 views
UGC NET CSE | October 2022 | Part 1 | Question: 45
Match List I with List II :List IList II(A) Type $0$(I) Finite automata(B) Type $1$(II) Tuning machine(C) Type $2$(III) Linear bound automata(D) Type $3$(IV) Pushdown aut...
admin
983
views
asked
Oct 23, 2022
Theory of Computation
ugcnetcse-oct2022-paper1
theory-of-computation
turing-machine
finite-automata
pushdown-automata
context-sensitive
linear-bounded-automata
+
–
0
0 votes
1
1 answer
3.6k
3.6k views
Context Sensitive Grammars
Is the following CSG for a^n b^n c^n correct?S->aSbC|abcCb->bCC->cIf not please explain why?
preethi01
3.6k
views
asked
Jan 29, 2022
Theory of Computation
theory-of-computation
context-sensitive
+
–
0
0 votes
0
0 answers
519
519 views
NIELIT 2021 Dec Scientist B - Section B: 80
The following grammer is an example of _____________ .$\text{A} \rightarrow \text{a A B C}$$\text{CB} \rightarrow \text{ B c}$$\text{A} \rightarrow \text{a b c}$$\text{ b...
soujanyareddy13
519
views
asked
Dec 7, 2021
Theory of Computation
nielit2021dec-scientistb
grammar
theory-of-computation
context-sensitive
+
–
0
0 votes
1
answers
1 answer
925
925 views
Closure Properties of Languages
let L = “CFL but not REGULAR”, Can we get complement of L as CFL?Unlike in the case of Recursively Enumerable(RE) language where if L = “RE but not RECURSIVE”, its comple...
UltraRadiantX
925
views
asked
Oct 9, 2021
Theory of Computation
theory-of-computation
context-free-language
context-sensitive
+
–
0
0 votes
2
answers
2 answers
917
917 views
UGC NET CSE | December 2019 | Part 2 | Question: 50
Consider the following language families:$L_1 \equiv$ The context-free languages$L_2 \equiv$ The context-sensitive languages$L_3 \equiv$ The recursively enumerable langua...
soujanyareddy13
917
views
asked
May 12, 2021
Theory of Computation
ugcnetcse-dec2019-paper2
theory-of-computation
context-free-language
context-sensitive
recursive-and-recursively-enumerable-languages
decidability
+
–
0
0 votes
2
2 answers
708
708 views
UGC NET CSE | June 2005 | Part 2 | Question: 32
Which of the following is the most general phase – structured grammar ?RegularContext – SensitiveContext freeNone of these
go_editor
708
views
asked
Mar 26, 2020
Compiler Design
ugcnetcse-june2005-paper2
compiler-design
grammar
context-sensitive
+
–
0
0 votes
1
1 answer
1.9k
1.9k views
Test Series
If $L_1$ is DCFL and $L_2$ is context free language. Consider the below given statementsWhich is correct between these and why ? (S1 is correct.. but why ??) . I couldn’...
Hardik Maheshwari
1.9k
views
asked
Jan 14, 2019
Theory of Computation
context-free-language
context-sensitive
context
deterministic-context-free-grammars
theory-of-computation
+
–
2
2 votes
1
1 answer
2.4k
2.4k views
TOC Which is(are) regular? Please explain 1 and 4.
Which of the following languages is regular? L = { bba (ba)* a^n-1 | n 0 }L = {a^nb^n | n < 1000 }L = {a^nb^k | n is odd or k is even }L = {wxw^R | w,x ∈(0+1)* }1, 3 and...
rahuljai
2.4k
views
asked
Dec 13, 2018
Theory of Computation
context-sensitive
regular-language
context-free-language
theory-of-computation
regular-expression
+
–
0
0 votes
0
0 answers
1.2k
1.2k views
Ace Book
The complement of the language L containing an equal number of a's , b's and c's isa)regularb)context freec)context sensitive but not context freed)recursive and not a CF...
abhishek1995_cse
1.2k
views
asked
Oct 21, 2018
Theory of Computation
context-free-language
pushdown-automata
context-sensitive
+
–
0
0 votes
0
0 answers
491
491 views
Doubt in Grammar
What is the difference between phase structured grammar and phrase structured grammar?
goluabhinan
491
views
asked
Sep 16, 2018
Theory of Computation
theory-of-computation
grammar
context-sensitive
compiler-design
+
–
0
0 votes
0
0 answers
568
568 views
Doubt in Grammar
Below is the grammar then find the language generated by given grammarS → ABCAB → aAx |bAy | εxb → bxya → ayC → εyb → byxC → BaCaB → BayC → BbCbB → Bbxa → axCorrect optio...
goluabhinan
568
views
asked
Sep 10, 2018
Theory of Computation
theory-of-computation
grammar
context-sensitive
+
–
0
0 votes
2
2 answers
2.3k
2.3k views
UGC NET CSE | July 2018 | Part 2 | Question: 37
Context sensitive language can be recognized by a Finite state machineDeterministic finite automataNon-deterministic finite automataLinear bounded automata
Pooja Khatri
2.3k
views
asked
Jul 13, 2018
Theory of Computation
ugcnetcse-july2018-paper2
theory-of-computation
context-sensitive
+
–
0
0 votes
2
2 answers
916
916 views
context sensitive grammer
it is given that in csg if @->#then length of @ should be less or equal to #then how aaB->c is a csg???
Ravi prakash pandey
916
views
asked
Apr 7, 2018
Theory of Computation
theory-of-computation
context-sensitive
+
–
1
1 vote
2
2 answers
1.2k
1.2k views
Regular and CFL
LC may be CFL LC cannot be CFL LC may be regular LC may or may not be CFL
Parshu gate
1.2k
views
asked
Dec 10, 2017
Theory of Computation
theory-of-computation
context-free-language
context-sensitive
+
–
2
2 votes
1
1 answer
1.0k
1.0k views
Doubt in CSL and CFL
$a) \{\ 0^i\ 1^j\ 2^k\ \ | where\ i\ \neq j\ or\ j\ \neq k\ \}$$b) \{\ 0^i\ 1^j\ 2^k\ \ | where\ i\ \neq j\ and\ j\ \neq k\ \}$a) CFL(union of two OR-ed compa...
Tuhin Dutta
1.0k
views
asked
Dec 4, 2017
Theory of Computation
theory-of-computation
context-sensitive
context-free-language
+
–
0
0 votes
0
0 answers
790
790 views
General syllabus doubt
Hello,The gate 2018 syllabus explicitly mentions regular languages, context free languages and turing machines. It does not say anything about context sensitive languages...
Tridhara Chakrabarti
790
views
asked
Nov 23, 2017
Study Resources
context-sensitive
theory-of-computation
syllabus
gate2018-preparation
grammar
+
–
5
5 votes
1
1 answer
1.6k
1.6k views
Regular and CFL
Let L={ai bj ck ┤|if j is odd then i=k} where i,j,k>0. Which of the following option is true about L? L is CSL but not CFL L is CFL but not DCFL L is regular L is DCF...
Parshu gate
1.6k
views
asked
Nov 16, 2017
Theory of Computation
theory-of-computation
regular-language
context-sensitive
context-free-language
+
–
Page:
1
2
next »