Question: For a given language, L = {arb | n1}{bra | n1}, (1) [10] Construct a minimal DFA with the minimum number of states that
For a given language, L = {arb | n1}{bra | n1}, (1) [10] Construct a minimal DFA with the minimum number of states that accepts L. (2) [10] Prove that your DFA in 1) is minimal. Hint: Check if any pair of the states are indistinguishable to be merged in the same class so that the number of states are minimized
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
