1. Minimize the number of states in the dfa in Figure 2.16. (90 91) (( 91...

Transcribed Image Text:

1. Minimize the number of states in the dfa in Figure 2.16. (90 91) (( 91 92)) 1 1 (1992) 0,1 0,1 0,1 2.Find minimal dfa's for the following languages. In each case prove that the result is minimal. (a) L = {an ban²2,m21}. (b) L = {an ba 20} U{ba a:n 21} (d) L = {anin +2 and n +4}. 1. Minimize the number of states in the dfa in Figure 2.16. (90 91) (( 91 92)) 1 1 (1992) 0,1 0,1 0,1 2.Find minimal dfa's for the following languages. In each case prove that the result is minimal. (a) L = {an ban²2,m21}. (b) L = {an ba 20} U{ba a:n 21} (d) L = {anin +2 and n +4}.