answer problem1, I post page 5 below

Another Example NFA Accepting and rejecting strings o What is the accepting path of abb through M? o What other paths are possible? o What are the accepting paths of ab machN = NFA (S.fromList [0. .5]) (S.fromList [Move 0 'a' 1, through N? o What happens with N and aa? Move 1 'b' 2, Move 0 ,a, 3, Move 3 'b' 4, Emove 3 4, Move 4 'b' 5]) (S.fromList [2,5]) Note the two sorts of nondeterminism this machine exhibits. 0 Machine M Machine N im Rover (CIS 352 Lexical Analysis February 5, 2018 15 /39 im Royer (CIS 352) February 5,2018 16 16/39 A small-step semantics for an NFA Applying the Small-Step Rules, 1 Notation For M = (States, Moves, start, Final): M=((0' 1, 2, 3 },{041,142, 242, 2..3},0, { 3 }) M-ss' =def (s, a, s') Moves MH s s,-def (s, e,s') e Moves. 2 ((s,a,s) E Moves) ((s,e,s) E Moves) An accepting path for baaa! Stage direction: Copy these onto the board. Another Example NFA Accepting and rejecting strings o What is the accepting path of abb through M? o What other paths are possible? o What are the accepting paths of ab machN = NFA (S.fromList [0. .5]) (S.fromList [Move 0 'a' 1, through N? o What happens with N and aa? Move 1 'b' 2, Move 0 ,a, 3, Move 3 'b' 4, Emove 3 4, Move 4 'b' 5]) (S.fromList [2,5]) Note the two sorts of nondeterminism this machine exhibits. 0 Machine M Machine N im Rover (CIS 352 Lexical Analysis February 5, 2018 15 /39 im Royer (CIS 352) February 5,2018 16 16/39 A small-step semantics for an NFA Applying the Small-Step Rules, 1 Notation For M = (States, Moves, start, Final): M=((0' 1, 2, 3 },{041,142, 242, 2..3},0, { 3 }) M-ss' =def (s, a, s') Moves MH s s,-def (s, e,s') e Moves. 2 ((s,a,s) E Moves) ((s,e,s) E Moves) An accepting path for baaa! Stage direction: Copy these onto the board