MODULE $2$

The transition table of a DFA is given below & find the following.

a$).$ Draw the table of distinguishability's for this automaton.

b$).$ Construct the minimum$-$state equivalent DFA.

Draw the table of distinguishable pairs for this automaton and Construct the

minimum state equivalent DFA.

Draw the table of distinguishable pairs for this automaton and Construct the

minimum state equivalent DFA.

Minimize the finite automaton $M1$ and $M2$ shown in figure below and show both the given

and the reduced one are equivalent.

The transition table of a DFA is given below & find the following.

a$).$ Draw the table of distinguishability's for this automaton.

b$).$ Construct the minimum$-$state equivalent DFA.