hello guys, i need ur help in converting NFA to DFA
DFA Algorithm :
s <- s0 { start from the initial state }
c <- nextchar { get the next character from the input string }
while (c != eos) do { do until the end of the string }
begin
s <- move(s,c) { transition function }
c <- nextchar
end
if (s belongs F) then { if s is an accepting state }
return “yes”
else
return “no”
NFA Algorithm:
S <- e-closure({q0})
c <- nextchar
while (c != eos) {
begin
s <- e-closure(move(S,c)) { set of all states can be accessible from a state in S by a transition on c }
c <- nextchar
end
if (S intersect F != 0) then { if S contains an accepting state }
return “yes”
else
return “no”
