1 votes 1 votes What will a minimal DFA over alphabet {a,b} which accepts all strings in which second symbol from RHS is always 'a' look like? Theory of Computation theory-of-computation finite-automata minimal-state-automata + – Aakanchha asked Aug 31, 2016 Aakanchha 744 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 4 votes 4 votes NFA is given as below To convert NFA into DFA You will get like this And it is minimal Prajwal Bhat answered Aug 31, 2016 • selected Aug 31, 2016 by ManojK Prajwal Bhat comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments Vishal Goyal commented Sep 18, 2016 reply Follow Share should we consider dead state in the conversion of nfa to dfa and then minimize the dfa 0 votes 0 votes Vishal Goyal commented Sep 18, 2016 reply Follow Share if we ae consedering the dead state then i am getting the 8 states 0 votes 0 votes Prajwal Bhat commented Sep 19, 2016 reply Follow Share There will be no dead state in NFA The approach in the answer is simple Construct NFA Convert it into DFA Minimise the DFA 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes The minimal FA that accept all string of a & b where nth symbol from rigth end side is fix cantain excatly 2^n state and 2*n-1 final state Hira Thakur answered Sep 1, 2016 Hira Thakur comment Share Follow See 1 comment See all 1 1 comment reply Aakanchha commented Sep 4, 2016 reply Follow Share in this case your statement holds true, but in general, can you pls explain how this statement is true ? 0 votes 0 votes Please log in or register to add a comment.
