Recent questions tagged context-sensitive

0 0 votes
1 1 answer
90
90 views
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...
0 0 votes
2 2 answers
328
328 views
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...
0 0 votes
0 0 answers
225
225 views
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...
0 0 votes
0 0 answers
163
163 views
Arrange the following Language Classes in ascending order according to their expressive power, as defined by Chomsky hierarchy:Context-free languagesContext-sensitive lan...
1 1 vote
1 1 answer
754
754 views
0 0 votes
1 1 answer
502
502 views
Is this language regular or not?xww^R | x,w E (a,b)*
3 3 votes
2 2 answers
1.1k
1.1k views
Can anyone explain $\overline{ww}$ is $CFL$ or $CSL$ And if $CFL$ can you write the equivalent $CFG$ for this ?
0 0 votes
0 0 answers
571
571 views
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...
1 1 vote
2 answers 2 answers
1.8k
1.8k views
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...
0 0 votes
2 2 answers
1.7k
1.7k views
L= {$a^nb^nc^nd^n; n\geq 0$} Given Language is a CSLTRUEFALSE
0 0 votes
1 answers 1 answer
1.4k
1.4k views
I don’t get the explanation, How do you categorize grammer on the basis of production?
0 0 votes
2 2 answers
983
983 views
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...
0 0 votes
1 1 answer
3.6k
3.6k views
Is the following CSG for a^n b^n c^n correct?S->aSbC|abcCb->bCC->cIf not please explain why?
0 0 votes
0 0 answers
519
519 views
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...
0 0 votes
1 answers 1 answer
925
925 views
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...
0 0 votes
2 answers 2 answers
917
917 views
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...
0 0 votes
2 2 answers
708
708 views
Which of the following is the most general phase – structured grammar ?RegularContext – SensitiveContext freeNone of these
0 0 votes
1 1 answer
1.9k
1.9k views
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’...
2 2 votes
1 1 answer
2.4k
2.4k views
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...
0 0 votes
0 0 answers
1.2k
1.2k views
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...
0 0 votes
0 0 answers
491
491 views
What is the difference between phase structured grammar and phrase structured grammar?
0 0 votes
0 0 answers
568
568 views
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...
0 0 votes
2 2 answers
2.3k
2.3k views
Context sensitive language can be recognized by a Finite state machineDeterministic finite automataNon-deterministic finite automataLinear bounded automata
0 0 votes
2 2 answers
916
916 views
it is given that in csg if @->#then length of @ should be less or equal to #then how aaB->c is a csg???
1 1 vote
2 2 answers
1.2k
1.2k views
LC may be CFL LC cannot be CFL LC may be regular LC may or may not be CFL
2 2 votes
1 1 answer
1.0k
1.0k views
$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...
0 0 votes
0 0 answers
790
790 views
Hello,The gate 2018 syllabus explicitly mentions regular languages, context free languages and turing machines. It does not say anything about context sensitive languages...
5 5 votes
1 1 answer
1.6k
1.6k views
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...