Computer Machine Math

1.) Write out the following DFA, D, using formal (set) notation. (You may use a table for the transition function.)

2.)Draw the automata for DFA D = (Q, , , q0, F), where: Q = {q0, q1, q2, q3} = {a, b} = {(q0, a, q1), (q0, b, q3), (q1, a, q3), (q1, b, q2), (q2, a, q0), (q2, b, q3), (q3, a, q3), (q3, b, q3)} F = {q2}

3.)Formally describe the language of the machine, D, from Exercise 1.0.2 (question 1)

4.)Formally describe the language of DFA D = (Q, , , q0, F), where: Q = {q0, q1, q2, q3} = {a, b} = {(q0, a, q1), (q0, b, q3), (q1, a, q3), (q1, b, q2), (q2, a, q0), (q2, b, q3), (q3, a, q3), (q3, b, q3)} F = {q2} (This is the machine from question 2.)

start go 93 92