1 votes 1 votes Is it possible to convert NFA with e-moves to NFA without e-moves ?I have read that using e-closure we can convert the NFA with e-moves to DFA.But can we also convert NFA with e-moves to NFA without e-moves? Theory of Computation theory-of-computation finite-automata + – rahul sharma 5 asked Jul 31, 2017 rahul sharma 5 418 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply pawan kumarln commented Jul 31, 2017 reply Follow Share yes possible 0 votes 0 votes rahul sharma 5 commented Jul 31, 2017 reply Follow Share But it can have multiple start states i think,will it be nfa then? 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes Yes it is possible to convert NFA with e-moves to NFA without e-moves. But we can not directly convert NFA with e-moves to DFA. Using e-closure first we convert the NFA with e-moves to NFA without e-moves and then to DFA. Raushank2 answered Jul 31, 2017 Raushank2 comment Share Follow See 1 comment See all 1 1 comment reply rahul sharma 5 commented Jul 31, 2017 reply Follow Share the NFA after removing null moves can have multiple start states.So can it be NFA? 0 votes 0 votes Please log in or register to add a comment.