Register

Recent questions tagged context-free-language

1 votes
1 answer
331
TOC WHICH IS CFL?
Please give reason for the answer.
Please give reason for the answer.
User Avatar
1 votes
0 answers
333
Toc dfa
Is this DCFL or not a^n b^2n c^3n. |n>=1 My logic is Push all a's Pop one a with one b After remain b push on stack After pop one b With 3c
Is this DCFL or nota^n b^2n c^3n. |n>=1My logic isPush all a'sPop one a with one bAfter remain b push on stackAfter pop one b With 3c
User Avatar
2 votes
0 answers
334
Union of two DCFL is ?
Consider two languages LA and LB over Σ={a,b}. LA= {a^ib^ja^k | i,j,k ≥ 0 and j=i+k} LB= {b^ia^jb^k | i,j,k ≥ 0 and j=i+k} Then ( LA ∪ LB ) is : A DCFL but not regular B CFL but not DCFL C None of the above D CSL but not CFL
Consider two languages LA and LB over Σ={a,b}.LA= {a^ib^ja^k | i,j,k ≥ 0 and j=i+k}LB= {b^ia^jb^k | i,j,k ≥ 0 and j=i+k} Then ( LA ∪ LB ) is : A DCFL but not regul...
User Avatar
2 votes
0 answers
337
cfl or not
the condition is 1) (i<=j) or (j<=i) , j=k 2) (i<=j) or (j<=i) ,j=k how should we interpret the condition given ?
the condition is 1) (i<=j) or (j<=i) , j=k 2) (i<=j) or (j<=i) ,j=khow should we interpret the condition given ?
User Avatar
3 votes
0 answers
338
Decidability
a) L is decidable b) L is undecidable c) L is regular d) None of these
a) L is decidableb) L is undecidablec) L is regulard) None of these
User Avatar
1 votes
1 answer
341
closure property
CFL over a single alphabet are always-> A. dcfl B. regular C. dcfl but not regular d. non regular
CFL over a single alphabet are always->A. dcflB. regularC. dcfl but not regulard. non regular
User Avatar
0 votes
1 answer
346
Context Free Language
CFL Over one alphabet will always be regular True False
CFL Over one alphabet will always be regularTrueFalse
User Avatar
1 votes
2 answers
348
DCFL or not??
$L1 = \bigl\{a^mb^nc^pd^q \mid m+q = n+p \bigr\}$ $L2 = \bigl\{a^mb^nc^pd^q \mid m+p = n+q \bigr\}$ 1. L1 is DCFL, L2 is not 2. L2 is DCFL, L1 is not 3. Both are not DCFL 4. Both are DCFL
$L1 = \bigl\{a^mb^nc^pd^q \mid m+q = n+p \bigr\}$$L2 = \bigl\{a^mb^nc^pd^q \mid m+p = n+q \bigr\}$1. L1 is DCFL, L2 is not2. L2 is DCFL, L1 is not3. Both are not DCFL...
User Avatar
0 votes
0 answers
349
Given Language is Context free or Regular ?
Let Ʃ = {a, b} and L = {anwan | n ≥ 1, w ∈ Ʃ*}. Then L is context free but not regular L is not context free but regular L is context free as well as regular L is neither context free and nor regular
Let Ʃ = {a, b} and L = {anwan | n ≥ 1, w ∈ Ʃ*}.ThenL is context free but not regularL is not context free but regularL is context free as well as regularL is neithe...
User Avatar
0 votes
0 answers
352
TOC CFL
Is it a viable possibility: For both L and L complement to be Context Free Language but not Regular? Why?
Is it a viable possibility: For both L and L complement to be Context Free Language but not Regular? Why?
User Avatar
0 votes
0 answers
353
TOC CFL Closure property doubt
Is it viable possibility that L and L complement can both be CFL but not Regular?
Is it viable possibility that L and L complement can both be CFL but not Regular?
User Avatar
1 votes
2 answers
356
Regular and CFL
LC may be CFL LC cannot be CFL LC may be regular LC may or may not be CFL
LC may be CFL LC cannot be CFL LC may be regular LC may or may not be CFL
User Avatar
1 votes
1 answer
357
Identify Class of Grammar
Hi mates, Please Identify Class of grammr with suitable Explanation, 1) L={WXW,/ W,X{a,b}*} 2) L={WXW,/ W,X{a,b}+} 3) L={WXWY,/ W,X,Y{a,b}+} 4)L={WXYW,/ W,X,Y{a,b}+} Thanks,
Hi mates,Please Identify Class of grammr with suitable Explanation,1) L={WXW,/ W,X{a,b}*}2) L={WXW,/ W,X{a,b}+}3) L={WXWY,/ W,X,Y{a,b}+}4)L={WXYW,/ W,X,Y{a,b}+}Thanks,
User Avatar
2 votes
1 answer
359
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 comparisons ) b) CSL( Double comaprison ) Am I correct?
$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...
User Avatar
Page: