- Show a DFSM to accept each of the following languages. The point of this exercise is to see how much harder it is to build a DFSM for tasks like these than it is to build an NDFSM. So do not simply build an NDFSM and then convert it. But do, after you build a DFSM, build an equivalent NDFSM. a. {we {a,b}* : the fourth from the last character is a}. b. {W {a,b}* : 3x, ye {a,b}*:((W = x abbaa y) v (w = x baba y))}