1 votes 1 votes The minimum number of states required to construct a DFA that recognizes the language of string that recognizes the language of string over alphabet {0,1} whose 10th symbol from the right end is 1 is ____________ Theory of Computation theory-of-computation finite-automata + – srestha asked Dec 30, 2017 srestha 1.9k views answer comment Share Follow See all 12 Comments See all 12 12 Comments reply Show 9 previous comments gauravkc commented Dec 30, 2017 reply Follow Share have a look at this https://gateoverflow.in/63063/dfa 0 votes 0 votes Mk Utkarsh commented Jan 1, 2018 reply Follow Share it cannot be minimized below 210 because its goal is to remember sequence of all those possible 10 bits so for remembering those 10 bits we need 210 states 0 votes 0 votes Mk Utkarsh commented Jan 1, 2018 reply Follow Share https://www.youtube.com/watch?v=XxuH_K-wzpg watch till 10 mins also it cannot be minimized because every state is used for a unique 10bits 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes it cannot be minimized below 210 because its goal is to remember sequence of all those possible 10 bits so for remembering those 10 bits we need 210 states Mk Utkarsh answered Jan 1, 2018 Mk Utkarsh comment Share Follow See all 0 reply Please log in or register to add a comment.