Question: A a b B a, b a a D Figure 2: The DFA to be minimized in Question 4. 4. (3 marks) Using the algorithm


A a b B a, b a a D Figure 2: The DFA to be minimized in Question 4. 4. (3 marks) Using the algorithm mark distinguishable pairs of states that is presented in Week 4 videos 2224 (and can be found in the course notes), minimize the number of states of the DFA depicted in Figure 2. Your answer should indicate in detail how you arrived at the solution: For each stage of the algorithm, indicate which pair(s) of states are marked as dis- tinguishable and explain the reason why. Draw the minimized state diagram where each state is labeled by the corresponding names of states in the original DFA that were merged together
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
