finite automata – Existence of infinite unique FSAs

It is reasonably simple to show that there are an infinite number of different finite state automata that can be constructed, but has it been proven if there is an infinite number of unique finite state automata? Meaning no automata that recognize the same language.

I asked my professor and he didn’t know, and I haven’t been able to find anything about it online.