This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: NFA Î» to NFA conversion Purpose â€¢ This presentation presents an example execution of the algorithm which takes as input an NFA with Î»transitions and produces as output an equivalent NFA without Î» transitions â€¢ Algorithm Specification â€“ Input: NFA M 1 with Î»transitions â€“ Output: NFA M 2 without Î»transitions Input NFA M 1 with Î» transitions Î» Î» Î» a a b b a,b 1 2 3 4 5 Compute all Î› closures Î» Î» Î» a a b b a,b 1 2 3 4 5 While this step is not necessary, it does make all future steps simpler. Compute Î› ({i}) for 0 < i < 6 Î› ({1}) = {1,2,3} Î› ({2}) = {2} Î› ({3}) = {3} Î› ({4}) = {4} Î› ({5}) = {5,1,2,3} = {1,2,3,5} Process State 1 Î» Î» Î» a a b b a,b 1 2 3 4 5 Compute Î´ * (1,b) First compute Î› ({1}) Î› ({1}) = {1,2,3} Now compute Î´(Î› ({1}) ,b) Î´ (1,b) = {} Î´ (2,b) = {4} Î´ (3,b) = {3} Î´(Î› ({1}) ,b) = {3,4} Finally compute Î› ( Î´(Î› ({1}) ,a)) = Î› ({3,4}) Î› ({3}) = {3} Î› ({4}) = {4} Î› ( Î´(Î› ({1}) ,b)) = {3,4} Î´ * (1,b) = {3,4} Compute Î´ * (1,a)...
View
Full Document
 Fall '07
 TORNG
 Input/output

Click to edit the document details