Obviously it can have a countably infinite number of strings. (Take the language descibed by the regular expression 0* as an example.) But can a RL have uncountably many strings? I'm leaning toward no, but I can't really back it up.
Can a regular language have uncountably many strings?
formal languages;regular languages;uncountability