PDA    
NPDA for {0^m 1^n : m != n}  // Exercise(Linz) find a DPDA.
Empty Stack // Final State or Empty Stack
0 1 // Input Alphabet
a b Z // Stack Alphabet
Z // Stack Start Symbol
q0 q1 q2 q3 q4 q5 // Machine States
q0 // Start State
// Set of Final States
q0 1 Z q1 Z // no 0's look for only 1's
q1 1 Z q1 Z
q1 \ Z q1 \
q0 0 Z q2 0Z // there are 0's
q2 0 0 q2 00
q2 \ 0 q3 \ // there are no 1's
q3 \ 0 q3 \ // empty stack of 0's
q3 \ Z q3 \
q2 1 0 q4 \ // there are 0's and 1's
q4 1 0 q4 \
q4 1 Z q1 Z // more 1's than 0's
q4 \ 0 q5 \ // more 0's than 1's
q5 \ 0 q5 \ // empty stack
q5 \ Z q5 \
end   // REQUIRED