Is the sets of possible morphemes of any given language a regular set, and can thus be recognized by a finite state automaton, or, equivalently, matched by regular expressions? Or are there any examples of recursive syntax in morphology that requires a context free grammar?