This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: 5. Draw the transition diagram of the finite state automaton (I, S, f, A, S ). 2 S S 2 S S 3 a / 0 a / 1 a / 0 b / 0 a / 0 b / 0 b / 1 b / 0 S S 2 a b a a b a b b S 1 S 3 DCS5028 DISCRETE STRUCTURES TUTORIAL 9 I = {a, b, c}, S = {S , S 1 , S 2 , S 3 }, A = { S 1 , S 2 } f I S a b c S S 1 S S 2 S 1 S S 3 S S 2 S 3 S 2 S S 3 S 1 S S 1 6. Determine whether the given string is accepted by the given finite state automaton below: aabaabb 3 S S 1 S 2 b a a a b b...
View
Full Document
 Spring '16
 NORIHAN BINTI HAMZAH
 S0, finite state automaton

Click to edit the document details