0 votes 0 votes For the nfa , find δ*(q0, 1010) and δ* (q1,00). ? Theory of Computation finite-automata theory-of-computation + – Harish Karnam asked Aug 18, 2017 Harish Karnam 556 views answer comment Share Follow See 1 comment See all 1 1 comment reply learner_geek commented Aug 18, 2017 reply Follow Share Answer should be 1st one =>q0 2nd one =>nothing(phi) 0 votes 0 votes Please log in or register to add a comment.
2 votes 2 votes δ*(qi,w)= qj qj= set of all possible States the automata maybe in, having started in state qi and having read w. Surya Dhanraj answered Aug 18, 2017 Surya Dhanraj comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes 1){ q0,q1} 1010 string accepted by nfa 2) {q2} 00 come to dead configuration starting from state q1 Surya Dhanraj answered Aug 18, 2017 Surya Dhanraj comment Share Follow See all 3 Comments See all 3 3 Comments reply Harish Karnam commented Aug 18, 2017 reply Follow Share In 2nd query, Why will q1 state won't take q0 as 0 can also take there...? 0 votes 0 votes Surya Dhanraj commented Aug 18, 2017 reply Follow Share It can go there also, because it's nfa But 00 will not be accepted 1 votes 1 votes suryaprakash commented Jan 12, 2018 reply Follow Share for the qst(1) u have answered only one side of the coin ,this can also be move to dead configuration that is ::: after taking q0----->q1 on i/p 1 from there q1------>can move to either q0 or q1 on i/p 0 0 votes 0 votes Please log in or register to add a comment.