2. (20 pts) Create a finite state automata that will accept the same set of strings...

Transcribed Image Text:

2. (20 pts) Create a finite state automata that will accept the same set of strings represented by the following regular expression. Let = {a,b,c,d}. You do not have to use dead states in this version and you also do not need to apply a formal method for regular expression to NFA/DFA conversion. (ab|d)*cca*d*b Show the transition function of your FSA using a graph below and then fill in the following for your FSA: (S,,8,so,F). You may want to create your graph in Powerpoint and copy/paste it. (5 pts) S = (2 pts) so = (3 pts) F = (10 pts) Graph: 2. (20 pts) Create a finite state automata that will accept the same set of strings represented by the following regular expression. Let = {a,b,c,d}. You do not have to use dead states in this version and you also do not need to apply a formal method for regular expression to NFA/DFA conversion. (ab|d)*cca*d*b Show the transition function of your FSA using a graph below and then fill in the following for your FSA: (S,,8,so,F). You may want to create your graph in Powerpoint and copy/paste it. (5 pts) S = (2 pts) so = (3 pts) F = (10 pts) Graph: