CLASS 4 : FA - EXAMPLE 1

1. Find whether string 011 is accepted or not in given graph. 

SOLUTION:

Here Inputs are (011)

Since     δ = ( Q , Σ) → Q

  δ* ( q0 , 011 )

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

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

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

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 (011) and the last token is 1 and last transaction is III. In III transaction we are not getting final state so we can say that the string (011) is not acceptable.