Consider the DFA M defined over the alphabet = {0, 1, 2} and depicted in...

   

Transcribed Image Text:

Consider the DFA MÅ defined over the alphabet Σ = {0, 1, 2} and depicted in figure 3. qs 0 1 2 90 1 1 2 2 Figure 3: DFA MB. 91 21 92 a) Convert MB into a GNFA. b) Use the procedure described in class to obtain a regular expression that describes the language recognized by MB. Remember to justify your solution by showing the different steps of the procedure as each state of the GNFA is removed. Consider the DFA MÅ defined over the alphabet Σ = {0, 1, 2} and depicted in figure 3. qs 0 1 2 90 1 1 2 2 Figure 3: DFA MB. 91 21 92 a) Convert MB into a GNFA. b) Use the procedure described in class to obtain a regular expression that describes the language recognized by MB. Remember to justify your solution by showing the different steps of the procedure as each state of the GNFA is removed.