1 votes 1 votes Construct a DFA to accept all strings (1+0)^ with an equal no of zeros and 1's ,such that each prefix has atmost one more zero then 1's and at most one more 1's then zeros . Theory of Computation theory-of-computation finite-automata + – Don't you worry asked Jun 11, 2016 Don't you worry 3.6k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 4 votes 4 votes Start & Final State =q0 shekhar chauhan answered Jun 11, 2016 selected Jun 11, 2016 by Don't you worry shekhar chauhan comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments Santhosh Devulapally commented Jun 17, 2016 reply Follow Share strings like 001 and 110 are in the language but not accepted by finite automata why? 0 votes 0 votes Amit Sharma commented Jun 17, 2016 reply Follow Share we need here same no of 0's and 1's .in your string we have both different. 1 votes 1 votes darshansharma_ commented Jul 27, 2019 reply Follow Share 100, 011 is not accepted by your DFA. 0 votes 0 votes Please log in or register to add a comment.