An NPDA with two internal states that accepts the language L(aabaa) would start in state q0. Upon reading the first a it would transition to state q1. In state q1 it would accept a's and b's and remain in q1. Upon reading the second a it would return to state q0 and accept the final a to accept the string.