Gate Bits FA and RE 2

In this class, We discuss Gate Bits FA and RE 2.

For Complete YouTube Video: Click Here

The reader should have the basics of finite automata. Click Here.

Gate 2011:

A deterministic finite automation (DFA)D with alphabet {a,b} is given below.

Which of the following finite state machines is a valid minimal DFA which accepts the same language as D?

Solution: A

Click the above video link for a complete explanation.

To solve the above question, we can use the basics of minimizing a DFA. Click Here.

By looking at the DFA, we can observe.

If we apply input symbol a on state P, we are moving to final state S.

Similarly, on state q, if we see input symbol a, we move to final state T.

The states T and S are moving to the same states with input symbol a or b.

So we can merge these two states, and both do the same thing.