Register

Recent questions tagged context-free-language

4 votes
2 answers
301
DCFL or Not
$\left \{ a^{m+n}b^{m+n}c^{n}|m,n\geq 1 \right \}$ $\left \{ a^{m+n}b^{m+n}c^{k} |m,n,k\geq 1\right \}$ $\left \{ a^{m+n}b^{m+k}c^{n+k} |m,n,k\geq 1\right \}$ Which one DCFL, CFL or CSL?
$\left \{ a^{m+n}b^{m+n}c^{n}|m,n\geq 1 \right \}$$\left \{ a^{m+n}b^{m+n}c^{k} |m,n,k\geq 1\right \}$$\left \{ a^{m+n}b^{m+k}c^{n+k} |m,n,k\geq 1\right \}$Which one DCFL...
User Avatar
1 votes
1 answer
302
self made doubt
How to know that the language needs 1 stack or more than one stack in order to know about it is regular, context-free or not. example L1={$a^i b^j c^k│i<j<k$} L2={$a^i b^j c^k│i<j \ or \ k<j$} L3={$a^i b^j c^k│i<j \ and \ k<j$}
How to know that the language needs 1 stack or more than one stack in order to know about it is regular, context-free or not.exampleL1={$a^i b^j c^k│i<j<k$}L2={$a^i b^j...
User Avatar
3 votes
2 answers
304
Grade up topicwise questions
L1={a^n b^n c ^m|m>=0 and n>=0} L2={a^m b^ n c^ n|n>=0 and m>=0} If L3=L1UL2 then how many of L1,L2,L3 are context free languages? A)1 (B)2 (C)3 (D) none Answer given option C. Please explain?
L1={a^n b^n c ^m|m>=0 and n>=0}L2={a^m b^ n c^ n|n>=0 and m>=0}If L3=L1UL2 then how many of L1,L2,L3 are context free languages?A)1 (B)2 (C)3 (D) noneAnswer given option ...
User Avatar
1 votes
4 answers
305
Context Free Language
L= { $a^{n}b^{m}$ | $n<=m<=2n$ } a) DCFL b) CFL but not DCFL c) Not CFL
L= { $a^{n}b^{m}$ | $n<=m<=2n$ }a) DCFLb) CFL but not DCFLc) Not CFL
User Avatar
4 votes
2 answers
307
ISRO2018-25
$CFG$ (Context Free Grammar) is not closed under: Union Complementation Kleene star Product
$CFG$ (Context Free Grammar) is not closed under: UnionComplementationKleene starProduct
User Avatar
0 votes
1 answer
308
Context Free Languages
Answer with explanation will be acknowledged.
Answer with explanation will be acknowledged.
User Avatar
1 votes
1 answer
309
Introduction to Computer Theory
Give CFG for the following language L =$ {(a^{m})(b^{m+n})(c^{n}) | m,n= 0,1,2,.....}$
Give CFG for the following languageL =$ {(a^{m})(b^{m+n})(c^{n}) | m,n= 0,1,2,.....}$
User Avatar
0 votes
1 answer
310
Exam - Foundation of Computing - 2018
Find a context-free grammar for the following language: L = { a^m b^m c^k | k <= m } (in order to show that the language is context-free)
Find a context-free grammar for the following language: L = { a^m b^m c^k | k <= m }(in order to show that the language is context-free)
User Avatar
5 votes
2 answers
313
Context Free Languages
Which of these languages are deterministic? $L_{1} =$ $\left \{a^{n}b^{n}: n \geq 1 \right \}\cup \left \{ b \right \}$ $L_{2} =$ $\left \{a^{n}b^{n}: n \geq 1 \right \}\cup \left \{ a \right \}$
Which of these languages are deterministic?$L_{1} =$ $\left \{a^{n}b^{n}: n \geq 1 \right \}\cup \left \{ b \right \}$$L_{2} =$ $\left \{a^{n}b^{n}: n \geq 1 \right \}\cu...
User Avatar
3 votes
1 answer
314
CFG to GNF
Convert the given CFG to GNF. $S \rightarrow MN$ $M\rightarrow aMb|\epsilon $ $N\rightarrow aNb|\epsilon $
Convert the given CFG to GNF.$S \rightarrow MN$$M\rightarrow aMb|\epsilon $$N\rightarrow aNb|\epsilon $
User Avatar
1 votes
1 answer
317
Linear Ambiguous Context Free Grammar
Please post few examples of Linear Ambiguous Context Free Grammar. It would be helpful if you post grammars for famous languages.
Please post few examples of Linear Ambiguous Context Free Grammar.It would be helpful if you post grammars for famous languages.
User Avatar
0 votes
1 answer
319
Introduction to Computer Theory
Write the CFG (Context Free Grammar) for the given condition: ((a^n).(b^(2n + 1)))
Write the CFG (Context Free Grammar) for the given condition:((a^n).(b^(2n + 1)))
User Avatar
2 votes
1 answer
327
Complement of CFL
How to prove that $\text{"complement of L }= \{WW^R \mid W \in \{a,b\}^*\} \text{ is CFL}" $?
How to prove that $\text{"complement of L }= \{WW^R \mid W \in \{a,b\}^*\} \text{ is CFL}" $?
User Avatar
1 votes
1 answer
330
TOC WHICH IS CFL?
Please give reason for the answer.
Please give reason for the answer.
User Avatar
Page: