The memory for any DFA is its state which can store some finite amount of data(present situation of the machine), if we want to store infinite data then the number of states require will be infinite, so dfa not possible. Now you may be thinking what about Infinite language, if a language is infinite then there must be a pattern that exists and we will use a loop in our dfa to tackle this without pattern dfa for infinite language is not possible.