This document contains 3 practice questions about constructing deterministic finite automata (DFAs) from non-deterministic finite automata (NFAs) or transition tables. Question 1 asks to construct a DFA equivalent to a given NFA with 4 states and transitions defined by a table. Question 2 asks to convert a given NFA to an equivalent DFA. Question 3 asks to construct a minimum state DFA from a given transition table defining an automaton with 8 states.

1. Practice Exercise
Q1: Construct a DFA equivalent to M=({q0,q1,q2,q3},{0,1},§,q0,{q3})
where q3 is the final state. The § function is as follows:
0 1
q0 {q0,q1} q0
q1 q2 q1
q2 q3 q3
q3 Ø q2
Q2: Convert the following NFA to DFA
0,1 0,1
Q3: Construct a minimum state automaton equivalent to DFA whose
transition is defined by table given below:
State a b
q0 q1 q2
q1 q4 q3
q2 q4 q3
q3 q5 q6
q4 q7 q6
q5 q3 q6
q6 q6 q6
q7 q4 q6
q0 q1 q2