DCFL Language

Question

Consider the following languages :

L1: {a bⁿ a²ⁿ | n ≥ 0 }

L2: { a a bⁿ a³ⁿ | 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

Comments

why not option B is true? i didn't find any counter example to say it is not DCFL

---

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 ?

---

@Na462

Should Be Correct.