1 votes 1 votes How many final states required in the equivalent DFA ? Theory of Computation theory-of-computation minimal-state-automata finite-automata + – dd asked Sep 20, 2016 dd 1.3k views answer comment Share Follow See 1 comment See all 1 1 comment reply dd commented Sep 20, 2016 i edited by dd Sep 20, 2016 reply Follow Share I found 1. and here is the DFA : First i have found the regex for the given NFA $(\text{a+b})^{*}\text{ba}(\text{a+b})^{*}$, and then directly constructed the min DFA. (without using table or minimization). Will it always work ? 1 votes 1 votes Please log in or register to add a comment.
Best answer 2 votes 2 votes there is only one final state needed. Pankaj kumar answered Sep 21, 2016 selected Sep 21, 2016 by vijaycs Pankaj kumar comment Share Follow See 1 comment See all 1 1 comment reply akankshadewangan24 commented Jun 25, 2017 reply Follow Share can explain steps plz 0 votes 0 votes Please log in or register to add a comment.