0 votes 0 votes Construct a minimal DFA which accepts set of all strings over {a,b}, such that $1)$Second symbol from $RHS$ should be $‘a’$ $2)$Third symbol from $RHS$ should be $‘a’$ Theory of Computation theory-of-computation finite-automata minimal-state-automata + – Lakshman Bhaiya asked Dec 27, 2018 Lakshman Bhaiya 580 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply adarsh_1997 commented Dec 27, 2018 reply Follow Share bro, the safe approach is to first draw the nfa and convert that nfa to dfa . try it otherwise i will post you the solution 0 votes 0 votes Lakshman Bhaiya commented Dec 27, 2018 reply Follow Share I'm so much confused can you give me the solution? 0 votes 0 votes adarsh_1997 commented Dec 27, 2018 reply Follow Share @Lakshman Patel RJIT ofcourse bro. 0 votes 0 votes Please log in or register to add a comment.
Best answer 1 votes 1 votes 2nd part AND 1st part. adarsh_1997 answered Dec 27, 2018 • selected Dec 28, 2018 by Lakshman Bhaiya adarsh_1997 comment Share Follow See all 2 Comments See all 2 2 Comments reply adarsh_1997 commented Dec 27, 2018 reply Follow Share @Lakshman Patel RJIT bro this is the approach 0 votes 0 votes Lakshman Bhaiya commented Dec 28, 2018 reply Follow Share Yes, very nice answer. $NFA\rightarrow DFA$ $DFA\rightarrow NFA$ $NFA\equiv DFA$ So, both are equivalent in power. $\Rightarrow$ Every $DFA$ is $NFA,$ but reverse need not be true. Please correct me if I'm wrong? 0 votes 0 votes Please log in or register to add a comment.