Consider below transition and verify whether the following strings will be accepted or not. Explain a. 010101 b.0011 c.111100

SOLUTION:

a)     010101

àA  |- 010101

   0B |- 10101

01C  |- 0101

                      010D  |- 101

                    0101A  |- 01

                   01010B |- 1

                 010101C |-   Not Accepted       Since C is not final state

b)     0011

àA  |- 0011

                           0B |- 011

00A  |- 11

                                              001D  |- 1

                                            0011A  |-     Accepted     Since A is final state

c)     111100

àA  |- 111100

   1D |- 11100

11A  |- 1100

                      111D  |- 100

                    1111A  |- 00

                   11110B |- 0

                 111100A |-   Accepted       Since A is final state