1 votes 1 votes I know it is weird to ask but we know that we can convert NFA TO DFA but is it any procedure to convert DFA to NFA. Divyanshum29 asked Jun 24, 2018 Divyanshum29 341 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Soumya29 commented Jun 24, 2018 reply Follow Share "Every $DFA$ is an $NFA$." 3 votes 3 votes Divyanshum29 commented Jun 24, 2018 reply Follow Share yes I know mam, actually in order to solve a que this idea came into my mind and i just posted it. Thanks 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes every dfa is an nfa.. so if you want the dfa to look like an nfa, u can just remove dead state or dead configurations and unwanted transitions which are not neccessary to satisfy the language rules. Sufayya answered Jul 5, 2018 Sufayya comment Share Follow See 1 comment See all 1 1 comment reply Divyanshum29 commented Jul 7, 2018 reply Follow Share Thanks, actually I was thinking that like S.T.T. (NFA to DFA) conversion we have something like that, Now I am ok with the explanation. 1 votes 1 votes Please log in or register to add a comment.
