Let we discuss about Short cut method for NDFA to DFA conversion.
we consider a graph given below
Q = {[φ] , [q0], [q1], [q2], [q0, q1], [q0, q2], [q1, q2], [q0, q1, q2]}
Σ = {0, 1}
q0 = q0
F = [q0]
we consider a graph given below
Q = {[φ] , [q0], [q1], [q2], [q0, q1], [q0, q2], [q1, q2], [q0, q1, q2]}
Σ = {0, 1}
q0 = q0
F = [q0]
Now write [φ] to any other suppose E
No comments:
Post a Comment