There is a saying by Computer Science Professor's everywhere :
PDA Checks the intelligence of Students, as certainly there is no approach except power and imagination of mind to solve problems and design PDA...
While thinking today i thought How can we design automata of a^2n b^(2n-1)
I tried my best : For example let q0 is initial state and top of the empty stack has Z.
So, Let say Transition of (q0, a , Z) = (q1,Z) Transition of (q1, a , a) = (q1,a) Transition of (q1, b , a) = (q2,-) Transition of (q2, $ , Z) = (qf,Z)
I was able to solve this problem all of a sudden...
My doubt is still the same, How to be the best in solving PDA problems and Is there any way to define a strategy to solve problems ?
P.S. Your comments are welcome if i did something wrong in above stated question