0 votes 0 votes The answer to this question is given as 6. Theory of Computation theory-of-computation finite-automata + – jenny101 asked Dec 6, 2016 jenny101 500 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes As NFA is not unique it can have other states also. Here NFA with 6 states. Prabhanjan_1 answered Dec 6, 2016 Prabhanjan_1 comment Share Follow See all 2 Comments See all 2 2 Comments reply jenny101 commented Dec 6, 2016 reply Follow Share we will consider only 1 pair of zeroes or all pair of zeroes.This is the part that confuses me. 0 votes 0 votes Prabhanjan_1 commented Dec 6, 2016 reply Follow Share given in question a pair of 0's. 0 votes 0 votes Please log in or register to add a comment.
