PDA-Doubt

Question

what is the DPDA for L=$a^{2n+1}b^n$ | n>1

Comments

how to make two or three consecutive pops

we can push more than one symbol at a time in to the stack, in same way we can pop more than one symbol from the stack at a time. 

I will give transition diagram, wait for some time

---

how about ignoring the first 'a'
pushing one 'a' for every 2 'a's
then popping one a for each b

---

a^2n+1b^n can be written as a a^2n b^n. Leave the first a and go to next state. Then push one a with 2 a . When a b comes , pop a . In the end stack will be empty.

Answer 1

(Sorry for poor image.)

Comments

@aditi19 ITS JUST HERE TO MAKE THINGS LOOK SIMPLE.

 

YOU CAN ALSO DO THIS BY MAKING LOOP. LIKE MAKING LOOP FOR e.g.   (aa)*  .....

P: (aa)* is just random example nothing to do with question

 

---

there will be a self loop in final state-$(ɛ,Zo/Zo)$

---

@aditi19 I'm not sure how that goes. Perhaps you can tell me your perspective why we need to do that?