29 votes 29 votes Consider the finite automaton in the following figure: What is the set of reachable states for the input string $0011$? $\{q_0,q_1,q_2\}$ $\{q_0,q_1\}$ $\{q_0,q_1,q_2,q_3\}$ $\{q_3\}$ Theory of Computation gatecse-2014-set1 theory-of-computation finite-automata easy + – go_editor asked Sep 26, 2014 edited May 1, 2019 by Pooja Khatri go_editor 14.8k views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply vaibhavkedia968 commented Jan 22, 2020 reply Follow Share What is meant by "reachable" over here? Set of terminating states for the string 0011 or set of all the states that can be visited by 0011? For eg, if q2 was the only state where 0011 could terminate, then the answer will be {q2} or {q0,q1,q2}? 0 votes 0 votes raja11sep commented Dec 21, 2021 reply Follow Share Extended transition function. 0 votes 0 votes theradash commented Jan 10 reply Follow Share Extended transition function from state q0 on string 0011. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes As you can see this was a very basic question so option A is the correct answer. shashankrustagi answered Dec 2, 2020 shashankrustagi comment Share Follow See all 0 reply Please log in or register to add a comment.