identify the language ?

Question

Let L = {a^mbⁿb^kd^l⎪(n+k = odd) only if m = l; m, n, k, l > 0}. Which of the following is true about L?

1)L is CFL but not DCFL

2)L is regular but not CFL

3)L is DCFL but not regular

4)none of the above

Comments

 L = {a^mbⁿb^kd^l⎪(n+k = odd) only if m = l; m, n, k, l > 0}

 L = {a^mb^pd^l⎪(p= odd) only if m = l; m, n, k, l > 0}

 L = {a^mb^pd^l⎪if(p= odd) then m = l; m, n, k, l > 0}

push all a's then check number of b;s are odd or not(done via dfa) , if answer is yes then number of a= number of  d(done via stack) by empty stack

if answer is yes ) then accept by final state

Hence it is DCFL

---

@Anu sir,

small correction it should be a^mb^pd^l

---

yes , i didnt loop at a has power m .