Write regular definitions for the following languages:
- All strings of lowercase letters that contain the five vowels in order.
- All strings of lowercase letters in which the letters are in ascending lexicographic order.
- Comments, consisting of a string surrounded by /* and */, without an intervening */, unless it is inside double-quotes (").
- All strings of digits with no repeated digits. Hint: Try this problem first with a few digits, such as $\{0,1,2\}$.
- All strings of digits with at most one repeated digit.
- All strings of a's and b's with an even number of a's and an odd number of b's.
- The set of Chess moves, in the informal notation, such as $p-k_{4}$ or $kbp \times qn$.
- All strings of a's and b's that do not contain the substring abb.
- All strings of a's and b's that do not contain the subsequence abb.