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?

Let's say that I want to invent a sound which, if it already isn't a Dutch word, could potentially be one, because it exhibits the right morphology. Is there some document where I could find "Dutch" under D in the index, and then navigate to a page starting on which all the rules are there? As i...

In old Russian the word фрязь ([fr'az'], apostrophe means a soft consonant) was used to denote a westerner. Although the word is not used any more, it is kept as part of some place names, such as a town Фрязино. The word's evolution suggests a similar path as in koning -> князь, witting -> витяз...