are all finite languages regular?
All finite languages are regular. If you have a finite set of strings that your languages matches, you can simply use alternation (string1|string2|...) to construct a regular expression to match them, or construct a finite automaton in a straightforward manner. It is not true that all regular languages are finite.