Register

Recent questions tagged context-free-language

0 votes
0 answers
244
A language is cfl or not
L = {a^(p+q) b^(p+q) a^p , p,q>=0} Which one of the following is true about L? L is a regular L is CFL but not regular L is not a CFL
L = {a^(p+q) b^(p+q) a^p , p,q>=0}Which one of the following is true about L?L is a regularL is CFL but not regularL is not a CFL
User Avatar
0 votes
1 answer
245
Context Free Languages
What is the difference between regular intersection and intersection? (I found out that CFL is closed under regular intersection but not under intersection) Thanks!
What is the difference between regular intersection and intersection?(I found out that CFL is closed under regular intersection but not under intersection)Thanks!
User Avatar
1 votes
1 answer
246
Context free language
Is this a deterministic context free language (DCFL) ? $a^{k}$ | k is even Thanks!
Is this a deterministic context free language (DCFL) ? $a^{k}$ | k is evenThanks!
User Avatar
1 votes
1 answer
247
Cfg to and from pda
Do i have to study the conversation of pda to Cfg or cfg to pda? Is this an important concept with relevance to gate? I know how to individually make them though.
Do i have to study the conversation of pda to Cfg or cfg to pda? Is this an important concept with relevance to gate? I know how to individually make them though.
User Avatar
0 votes
3 answers
248
CFL or CSL
Let L = $\{ a^n b^m | m , n \in \textbf{N} \text{ and m is multiple of n}\}$ How do we prove that this language is not CFL.
Let L = $\{ a^n b^m | m , n \in \textbf{N} \text{ and m is multiple of n}\}$How do we prove that this language is not CFL.
User Avatar
0 votes
1 answer
253
Context free languages
{x w c w1, where x,w belong to {a,b}* and w1 is reverse of w} The language given is deterministic context-free language or non-deterministic context-free language?
{x w c w1, where x,w belong to {a,b}* and w1 is reverse of w} The language given is deterministic context-free language or non-deterministic context-free language?
User Avatar
1 votes
1 answer
256
Madeasy test series
Does equivalence of CFG decidable ? That is for two CFG G1 and G2 L(G1)= L(G2)? And if it is DCFG than is it decidable.
Does equivalence of CFG decidable ?That is for two CFG G1 and G2 L(G1)= L(G2)?And if it is DCFG than is it decidable.
User Avatar
0 votes
1 answer
258
context free grammer
consider following grammer S → aSb / aSbb / aSbbb / ….. is language generated by above grammer is DCFL?
consider following grammerS → aSb / aSbb / aSbbb / …..is language generated by above grammer is DCFL?
User Avatar
0 votes
1 answer
259
Gate mock Toc
Answer is a) but I got c) please see it
Answer is a) but I got c) please see it
User Avatar
0 votes
2 answers
262
CFL langauage
How a^i b^j c^k | i= j+k is CFL? Please explain Thanks
How a^i b^j c^k | i= j+k is CFL?Please explainThanks
User Avatar
1 votes
3 answers
270
NIELIT 2018-33
The language $\{ W^a X^b Y^{a+b} \mid a, b, >1\}$ is Regular Context-free but not regular Context sensitive but not context free Type$=0$ but not context sensitive
The language $\{ W^a X^b Y^{a+b} \mid a, b, >1\}$ isRegularContext-free but not regularContext sensitive but not context freeType$=0$ but not context sensitive
User Avatar
Page: