2 votes 2 votes The minimum no of states required to construct a DFA accepting the language of binary strings which contain an equal no of (01) and (10) is Theory of Computation theory-of-computation finite-automata minimal-state-automata + – Tuhin Dutta asked Dec 31, 2017 Tuhin Dutta 512 views answer comment Share Follow See all 9 Comments See all 9 9 Comments reply Show 6 previous comments Mk Utkarsh commented Jan 1, 2018 reply Follow Share 5 states 0 votes 0 votes trakmaker commented Jan 4, 2018 reply Follow Share i think your machine is rejecting the minimum posssible string 0 and 1 which has both equal number of 01 and 10's i.e. zero 0 votes 0 votes Mk Utkarsh commented Jan 4, 2018 reply Follow Share initial should be final too rest all is fine :) thanks for pointing out 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes five state Chandrabhan Vishwa 1 answered Dec 31, 2017 Chandrabhan Vishwa 1 comment Share Follow See all 0 reply Please log in or register to add a comment.