Why is {a^nb^n | n >= 0} not regular?

Question

In a CS course I\'m taking there is an example of a language that is not regular:

{a^nb^n | n >= 0}

I can understand that it is not regu

Answer 1

Finite State Automaton has no data structure (stack) - memory as in case of push down automaton. Yeah it can give you some 'a's followed by some 'b's but not exact amount of 'a' followed by that no 'b'.