CLASS 5 : FA - EXAMPLE 2

Find  whether string 0111 is accepted or not.

SOLUTION:

Here Inputs are (0111)

Since     δ = ( Q , Σ) → Q

  δ* ( q0 , 0111 )

  δ* ( δ (q0 , 0 ) , 111 ) → q1  ---------- I

  δ* ( δ (q1 , 1 ) , 11 ) → q3 -------------II

   δ* ( δ (q3 , 1 ) , 1 ) → q1 -------------III

   δ (q1 , 1 ) → q3  -----------------------IV

Note : For checking acceptance of any string means , if we get final state on inserting / giving last token or input then we say that the given string is accepted.

Here in this question string is (0111) and the last token is 1 and last transaction is IV. In IV transaction we get final state so we can say that the string (0111) is acceptable.