Question

(40pt) For each of the following languages, prove whether it is regular or not. If it is, then: - construct a NDFSM for it - convert the NDFSM into a DFSM (include trap/dead states) - minimize the DFSM - convert one of the machines into a regular expression; give a simple regular expression; you may have to construct it directly if the machines give horrible expressions Show your work. If you can give directly a DFSM, then you don’t have to provide a NDFSM. If you provide directly the minimal DFSM, you still need to argue why it is minimal. L = {w ∈ {a, b} ∗ | w has aa and bb as substrings, but not aba} (do not give a reg. exp. here).

          (40pt) For each of the following languages, prove whether it is regular or not. If it is, then: - construct a NDFSM for it - convert the NDFSM into a DFSM (include trap/dead states) - minimize the DFSM - convert one of the machines into a regular expression; give a simple regular expression; you may have to construct it directly if the machines give horrible expressions Show your work. If you can give directly a DFSM, then you don’t have to provide a NDFSM. If you provide directly the minimal DFSM, you still need to argue why it is minimal. L = {w ∈ {a, b} ∗ | w has aa and bb as substrings, but not aba} (do not give a reg. exp. here).

Added by Christopher A.

Question

Please give Ace some feedback