Finiteness of Regular Language

Question

We all know that (a + b)* is a regular language for containing only symbols a and b. But (a + b)* is a string of infinit

Answer 1

It just means there exists a finite regular expression for the specified language and is no where related to no of strings generated from the expression. For many regular languages we can generate infinite number of strings which follow that language but to that language is regular to prove that we need a regular expression which must be finite. So here the expression (a+b)* is finite way of expressing 0-n number of a's or b's or combination of that but n can take any value which results in infinite no. of strings.