I am trying to implement a push-down automata which can recognize the context-free language L={ a^n*b^n| n ≥ 0} and Im using these eight strings as the inputs, aabb$, aaabbb