#peterlinz

Question

How can we show that { aⁿb^m, m>= n+2} is deterministic ?

for eg for a⁴b⁶ or in general ?

Comments

It has Deterministic move.

---

Sir, was D necessary ? Couldn't we do popping b's and accepting in same state i.e C?

Answer 1

by Drawing DPDA for this language

Comments

Sir according to this some of a's still will be left in stack ...is that acceptable?

---

@Pawan if a's are remaining then final state will never reached by the above PDA.

@Akash transition for bb,bbb,bbbb... is remaining.

---

in loop b,z0 / z0  we are bypassing all b's