Finiteness of Regular Language

We all know that (a + b)* is a regular language for containing only symbols a and b. But (a + b)* is a string of infinite length and it is regular as we can build a finite automata, so it should be finite.

Can anyone please explain this?