title: pda to accept the language L={a^n b^m | n<m}
body: <p>I know how to solve for m&lt;n but I'm struggling to understand the logic for m&gt;n.</p>
  <p>In m&lt;n we push all a's in the stack and when we get b we popped out one a, when the input ends with a stack containing m-n a's the machine should enter the final state</p>
  <p>How can I do for m&gt;n....</p>