Define a regular grammar which defines a language whose sent

Define a regular grammar which defines a language whose sentences are the set of all strings of letters which contain each of the five owes exactly once and in order. Use only lower case letters. For example, your regular grammar must be capable of generating the strings adieu detour, and top, but not anon, audio, and amigo. You may use only the, +, [], and A metacharacters in your regular grammar.

Solution

L : [b-d f-h j-n p-t v-z]

String : L*(a|A)+ L*(e|E)+ L*(i|I)+ L*(o|O)+ L*(u|U)+L*