2.2. For each of the following NFAs, draw the state diagram, trace its operation on each...

   

Transcribed Image Text:

2.2. For each of the following NFAs, draw the state diagram, trace its operation on each of the strings shown, and indicate which of them are accepted. (a) 1 2 3 a {1, 2} {1} {1, 2} a b € 1 {1} {3} {4} (b) 2 {2} {1} {} 1 (c) 2 3 {1} {4} {2} 4 {3} {2} {} 3 4 b {3} {2, 3} {1} a {1, 2} {3} {3,4} {1} b {2} {2, 3} {2} {2} Strings: aaab, baaab, ababab, baabb, aba Strings: abaab, baabb, bbaba, aabb, bababa, abbb € с {1, 3} {4} {1} {2,4} {1} {3} {} Strings: abaabc, bacabb, cbaba, ccaacc, babcb 2.2. For each of the following NFAs, draw the state diagram, trace its operation on each of the strings shown, and indicate which of them are accepted. (a) 1 2 3 a {1, 2} {1} {1, 2} a b € 1 {1} {3} {4} (b) 2 {2} {1} {} 1 (c) 2 3 {1} {4} {2} 4 {3} {2} {} 3 4 b {3} {2, 3} {1} a {1, 2} {3} {3,4} {1} b {2} {2, 3} {2} {2} Strings: aaab, baaab, ababab, baabb, aba Strings: abaab, baabb, bbaba, aabb, bababa, abbb € с {1, 3} {4} {1} {2,4} {1} {3} {} Strings: abaabc, bacabb, cbaba, ccaacc, babcb

Answer rating: 100% (QA)

BASIC TERMS DFA is known as Deterministic Finite Automata ie for each input symbol it goes to next s... View the full answer