0 votes 0 votes Consider the following languages : L1: {a bn a2n | n ≥ 0 } L2: { a a bn a3n | n ≥ 0 } Which of the following is true ? A. L1 U L2 is regular B. L1 U L2 is DCFL C. L1 intersection L2 is non regular D. L1 U L2 is not CFL Theory of Computation theory-of-computation dcfl context-free-language + – Na462 asked Sep 11, 2018 edited Sep 11, 2018 by Shaik Masthan Na462 697 views answer comment Share Follow See all 6 Comments See all 6 6 Comments reply Show 3 previous comments Shaik Masthan commented Sep 11, 2018 reply Follow Share why not option B is true? i didn't find any counter example to say it is not DCFL 0 votes 0 votes Na462 commented Sep 11, 2018 reply Follow Share Option B is true. Can u explain i am having little Doubt Two DCFLs aren't closed under Union but its a general property for some languages it may be true My procedure:- I will skip first a and if i find a b then for every b i will push two b's in the stack and then after when a will come ill start popping. If instead of b in second position i get an a i will skip it again and then for every b i will push three b in stack and later start popping when a start to arrive. Is it correct thinking ? 0 votes 0 votes Shaik Masthan commented Sep 11, 2018 reply Follow Share @Na462 Should Be Correct. 0 votes 0 votes Please log in or register to add a comment.