GATE-2008
[closed]

in Theory of Computation closed by
119 views
1 vote
1 vote
closed as a duplicate of: GATE IT 2008 | Question: 32

If the final states and non-final states in the DFA
below are interchanged, then which of the following
languages over the alphabet {a, b} will be accepted
by the new DFA?

How to convert this FA to Reg-ex By state Elimination method

 

in Theory of Computation closed by
by
119 views