krumb

hi! I can't seem to answer the following question and i'd be very glad if someone could help me out: is it possible that a regular language would be defined by an infinite regular expression? or, in other words, if L is a regular language, must the regular expression describing L be a finite one? thanks!