NPTEL IIT Guwahati

Note that states are not accessible and hence can be removed. This gives us the following simplified DFA with only 3 states.

It is interesting to note that we can avoid encountering all those inaccessible or unnecessary states in the equivalent DFA by performing the following two steps inductively.


	Removing Transition	Print this page
	First \| Last \| Prev \| Next
	Note that states are not accessible and hence can be removed. This gives us the following simplified DFA with only 3 states. It is interesting to note that we can avoid encountering all those inaccessible or unnecessary states in the equivalent DFA by performing the following two steps inductively.
	First \| Last \| Prev \| Next