Limitations of Finite Automata:
FA can only count finite input.
There is no finite auto ma that can find and recognize set of binary string of equal Os & 1s.
Set of strings over "(" and ")" & have balanced parenthesis.
Input tape is read only and only memory it has is, state to state.
It can have only string pattern.
Head movement is in only one direction.