Gate Bits FA and RE 3

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

For Complete YouTube Video: Click Here

The reader should have prior knowledge of finite automata. Click Here.

Gate 2008:

Match the following NFAs with the regular expressions they correspond to

1. ϵ + 0(01*1 + 00) * 01*

2. ϵ + 0(10 *1 + 00) * 0

3. ϵ + 0(10 *1 + 10) *1

4. ϵ + 0(10 *1 + 10) *10 *

(A) P – 2, Q – 1, R – 3, S – 4

(B) P – 1, Q – 3, R – 2, S – 4

(C) P – 1, Q – 2, R – 3, S – 4

(D) P – 3, Q – 2, R – 1, S – 4

Answer C

Click the above video link for a complete explanation.

To understand the basics for converting finite automata to regular expression using state elimination, click here.