This preview shows pages 1–6. Sign up to view the full content.
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
This note was uploaded on 07/25/2008 for the course CSE 460 taught by Professor Torng during the Fall '07 term at Michigan State University.
 Fall '07
 TORNG

Click to edit the document details