Design finite automat a (deterministic or nondeterministic) for each of the languages of Exercise 3.3.5. Exercise 3.3.5 Write regular definitions for the following languages: a) All strings of...

Design finite automat a (deterministic or nondeterministic) for each of the languages of Exercise 3.3.5.

Exercise 3.3.5

Write regular definitions for the following languages:


a) All strings of lowercase letters that contain the five vowels in order.

b) All strings of lowercase letters in which the letters are in ascending lexicographic order.

c) Comments, consisting of a string surrounded by /* and */, without an intervening */, unless it is inside double-quotes (").

!! d) All strings of digits with no repeated digits. Hint: Try this problem first with a few digits, such as {0,1,2}.


!! e) All strings of digits with at most one repeated digit.

!! f) All strings of a's and 6's with an even number of a's and an odd number of 6's.

g) The set of Chess moves, in the informal notation, such as p-k 4 or kbpxqn.

!! h) All strings of a's and 6's that do not contain the substring a66.

i) All strings of a's and 6's that do not contain the subsequence a66.