title: NPDA for this language with n and n-1
body: <p><img src="https://i.stack.imgur.com/JuUWX.png" alt="enter image description here"></p>
  
  <p>To draw the transition graph of a NPDA that accepts L, I think one could start this problem by reading an <code>a</code>, writing an <code>a</code>, then moving right, then doing the same for <code>b</code> so that there is some state q<sub>1</sub> that is getting those "ab" movements.  But then how is it possible to get <code>bb</code> to have <code>n-1</code>?</p>
  
  <p>I have something that I think works but I'm teaching this to myself so maybe someone can show me where the <code>n</code> and <code>n-1</code> could be done correctly.</p>
  
  <p>EDIT:</p>
  
  <p>But now this should be it --</p>
  
  <p><img src="https://i.stack.imgur.com/pNEC9.jpg" alt="enter image description here"></p>