Register

Recent questions tagged dcfl

1 votes
0 answers
31
DCFL01
What is DCFL U Regular ? Every Regular lang is DCFL , That means DCFL U DCFL = not DCFL ? since DCFL's are not closed under union
What is DCFL U Regular ?Every Regular lang is DCFL ,That means DCFL U DCFL = not DCFL ?since DCFL's are not closed under union
User Avatar
2 votes
0 answers
32
Intersection of two DCFLs
$ L_1\ =\ \{ \ a^mb^mb^na^n | m,n\ >\ 0\}\\ L_2\ =\ \{ \ a^mb^na^nb^m | m,n\ >\ 0\}$ Find $L_1 \cap L_2$
$ L_1\ =\ \{ \ a^mb^mb^na^n | m,n\ >\ 0\}\\ L_2\ =\ \{ \ a^mb^na^nb^m | m,n\ >\ 0\}$Find $L_1 \cap L_2$
User Avatar
2 votes
0 answers
33
Self Doubt
Can Anyone please explain the difference between DCFL and NDCGL with 4-5 good and tricky,complex examples.
Can Anyone please explain the difference between DCFL and NDCGL with 4-5 good and tricky,complex examples.
User Avatar
1 votes
2 answers
35
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
1 votes
1 answer
36
is it DCFL OR NOT?
User Avatar
0 votes
1 answer
37
DCFL or not
Consider the following languages: L1={abna2n|n>=0} L2={aabna3n|n>=0} Why L1UL2 is DCFL please explain?
Consider the following languages:L1={abna2n|n>=0}L2={aabna3n|n>=0}Why L1UL2 is DCFL please explain?
User Avatar
1 votes
2 answers
38
(DCFL U Reg) '
Hi Guys, What will be ${\left ( DCFL \cup Regular \right )} '$ ?
Hi Guys,What will be ${\left ( DCFL \cup Regular \right )} '$ ?
User Avatar
6 votes
1 answer
39
DCFL or NOT
Consider the follwoing Language L1= {0n1*0n | n>0} is DCFL or Not? L2= {0n1+0n | n>0} is DCFL or Not?
Consider the follwoing LanguageL1= {0n1*0n | n>0} is DCFL or Not?L2= {0n1+0n | n>0} is DCFL or Not?
User Avatar
6 votes
1 answer
41
DCFL,AMBIGUITY
User Avatar
1 votes
3 answers
42
Draw PDA for this
L = {cambndn} Please draw PDA for this Language!
L = {cambndn} Please draw PDA for this Language!
User Avatar
1 votes
1 answer
43
DCFL, LR(k), 2DFA
Let L1 be a language from DCFL, L2 be from LR(k) grammar, and L3 be a language accepted by 2DFA. Choose the correct statement, 1) There is no algorithm to decide if L1⋂L2 is empty. 2) L1 = L2. 3) L2 = L3. 4) A problem of L1 = L3 is undecidable.
Let L1 be a language from DCFL, L2 be from LR(k) grammar, and L3 be a language accepted by 2DFA.Choose the correct statement,1) There is no algorithm to decide if L1⋂L2...
User Avatar
0 votes
1 answer
45
UNION of two Languages
L={an∣n≥0} U {anbn∣n≥0} What will be the result? How's it's DCFL? Please explain with an example! Thanks
L={an∣n≥0} U {anbn∣n≥0}What will be the result? How's it's DCFL? Please explain with an example! Thanks
User Avatar
1 votes
1 answer
49
Design PDA for
Design PDA for i) L={a^n b^m c^n|m,n>=1} ii) L={a^m b^n c^p|m+n=p} iii) L={a^i b^i c^j|i,j=1} iv) L={a^i b^j c^j|i,j>=1} I have made an attempt to draw pda Please can someone crosscheck the answer?
Design PDA for i) L={a^n b^m c^n|m,n>=1}ii) L={a^m b^n c^p|m+n=p}iii) L={a^i b^i c^j|i,j=1}iv) L={a^i b^j c^j|i,j>=1}I have made an attempt to draw pda Please can someone...
User Avatar
5 votes
2 answers
51
TOC DCFL vs CFL
1. L ={ a^n b^m c^x d^y | n=m or x=y} 2. L ={ a^n b^x c^m d^y | n=m or x=y} Classify above in CFL/DCFL?
1. L ={ a^n b^m c^x d^y | n=m or x=y}2. L ={ a^n b^x c^m d^y | n=m or x=y}Classify above in CFL/DCFL?
User Avatar
3 votes
2 answers
52
is palindrome of even length is DCFL?
how to determine that this is not in DCFL and also for the odd length palindrome language as well,
how to determine that this is not in DCFL and also for the odd length palindrome language as well,
User Avatar
1 votes
2 answers
53
Toc CFL DCfL
Caption Is this CFL or DCFL or not CFL
CaptionIs this CFL or DCFL or not CFL
User Avatar
6 votes
3 answers
54
DCFLs
S1: Every DCFL has unambiguous grammar S2: Every language accepted by DPDA with final state is also accepted by DPDA with empty stack S1 is given as true and S2 false. Explain how?!
S1: Every DCFL has unambiguous grammarS2: Every language accepted by DPDA with final state is also accepted by DPDA with empty stackS1 is given as true and S2 false.Expla...
User Avatar
0 votes
3 answers
60
CFL or not
It seemed like , this is textbook example of non-CFL language ; will require 2 comparisons . That means no complement exist was the answer , I was expecting. Why answer given is CFL , am I missing something ?
It seemed like , this is textbook example of non-CFL language ; will require 2 comparisons . That means no complement exist was the answer , I was expecting. Why answer g...
User Avatar
Page: