Additional Problem 5-12 Look at figure 1 (above) again, but this time think of it as an NFA rather than a DFA. Give a formal definition of figure 1 as an NFA (i.e. describe it as an NFA-style 5-tuple) o Additional Problem 5-13 Look at figure 2 (above) again, but this time think of it as an NFA rather than a DFA. Give a formal definition of figure 2 as an NFA o Additional Problem 5-14 Look at figure 3 (above) again, but this time think of it as an NFA rather than a DFA. Give a formal definition of figure 3 as an NFA o Additional Problem 5-15 Figure 4 (above) is not a DFA, but it is an NFA. Answer all of the following questions for the DFA shown in Figure 4. In each case, specify the sequence of o Does it accept the string Does it accept the string 0 Does it accept the string 1 Does it accept the string 00 Does it accept the string 01 Does it accept the string 10 Does it accept the string 11 Does it accept the string 000 Does it accept the string 001 Does it accept the string 010 Does it accept the string 011 Does it accept the string 100 Does it accept the string 101 Does it accept the string 110 Does it accept the string 111 Is the language of this NFA finite or infinite?? Additional Problem 5-16 Give a regular expression that represents the language accepted by the NFA in figure4 o o Additional Problem 5-17 Give a formal definition of the NFA shown in Figure 4 ie describe it as an NFA-style 5-tuple) Additional Problem 5-18 Figure 5 (above) is not a DFA, but it is an NFA. Answer all of the following questions for the NFA shown in Figure 5 In each case,specify the sequence of o that isit and then answer Does it accept the string Does it accept the string a Does it accept the string b Does it accept the string alb Does it accept the string ba Additional Problem 5-12 Look at figure 1 (above) again, but this time think of it as an NFA rather than a DFA. Give a formal definition of figure 1 as an NFA (i.e. describe it as an NFA-style 5-tuple) o Additional Problem 5-13 Look at figure 2 (above) again, but this time think of it as an NFA rather than a DFA. Give a formal definition of figure 2 as an NFA o Additional Problem 5-14 Look at figure 3 (above) again, but this time think of it as an NFA rather than a DFA. Give a formal definition of figure 3 as an NFA o Additional Problem 5-15 Figure 4 (above) is not a DFA, but it is an NFA. Answer all of the following questions for the DFA shown in Figure 4. In each case, specify the sequence of o Does it accept the string Does it accept the string 0 Does it accept the string 1 Does it accept the string 00 Does it accept the string 01 Does it accept the string 10 Does it accept the string 11 Does it accept the string 000 Does it accept the string 001 Does it accept the string 010 Does it accept the string 011 Does it accept the string 100 Does it accept the string 101 Does it accept the string 110 Does it accept the string 111 Is the language of this NFA finite or infinite?? Additional Problem 5-16 Give a regular expression that represents the language accepted by the NFA in figure4 o o Additional Problem 5-17 Give a formal definition of the NFA shown in Figure 4 ie describe it as an NFA-style 5-tuple) Additional Problem 5-18 Figure 5 (above) is not a DFA, but it is an NFA. Answer all of the following questions for the NFA shown in Figure 5 In each case,specify the sequence of o that isit and then answer Does it accept the string Does it accept the string a Does it accept the string b Does it accept the string alb Does it accept the string ba