Question

2. Given the following nondeterministic finite automaton and strings, for each string indicate if the string is accepted by the automaton or not (Yes or No). start —+1 91 а - 92 23 (a) € (b) aaabb (c) abb (d) aaa

Answer 1

IF A STRING REACHES TO ITS FINAL STATE OF A DFA THEN THE STRING WILL BE ACCEPTED BY DFA CHECK FOR EACH OPTION a) from the graph (Start)01-->Q4(final) This string reaches final state, Hence string will be accepted.( Answer Yes) b)aaabb а а а ь р (start)01-->Q2-->Q2-->Q2-->Q3-->Q2 does not reaches final state, Hence string will not be accepted. (answer No) c)abb a bb (start)01-->Q2-->Q3-->Q2 does not reaches final state, Hence string will not be accepted. (answer No) (start)01-->Q2-->Q2-->Q2 does not reaches final state, Hence string will not be accepted. (answer No)