Q1 Regular Language / FA Suppose for the DFA in the graph below, E = {0, 1}, Start state S = So, Final states F = {S2}. For each of the given input strings, decide whether the DFA would accept or reject the string. 1 So S1 1 1 S3 S2 1 Q1.1 0000 О Аccept O Reject Q1.2 1111 Ассept O Reject
DO NOT COPY FROM OTHER WEBSITES
Correct and detailed answer will be Upvoted else downvoted. Thank you!
DFA or Deterministic Finite Automata is defined a finite state machine which accepts a string if it reaches a final state, otherwise rejects it.
Here in the given Question initial state is S0 and final state is S2.
Question 1.1:
The given string is 0000.
For input 0000 the transition will occur from S0 to state S0.
First input 0 will go from S0 to state S2 then again for input 0 transition will occur from S2 to S0 then again for input 0 transition will take place from S0 to S2 and the final 0 will transit from S2 to S0. Since the final transition ends at state S0 which is not final state. Hence the given string 0000 will not be accepted.
Therefore the correct answer is
Reject.
Step by step
Solved in 4 steps
