Can someone please help me answer this question Consider the

Can someone please help me answer this question?

Consider the following finite automata: A. Let them be named A, B, C, D from left to right. For which of these automata M is L(M) exactly the following sets of strings? There may not be any correct answers for some of the questions. After each part (4.1, 4.2, 4.3, 4.4, 4.5, 4.6) write the name (letter) of the automaton that recognizes the given set of strings, or write \"none\" if none of the automata fit the description. Strings having an even number of zeroes. Strings having an odd number of zeroes. Strings having an even number of ones. Strings having an odd number of ones. Strings of even length. Strings of odd length. Among the following statements, write the numbers of all correct (true) statements here: ______________

Solution

Answer:

4.1) A

4.2) B

4.3) A

4.4 ) C

4.5) A and D

4.6 ) B and C

For accepting even numbers , initial state should be the final state . Transition goes like this : 0 , 2 , 4 , ...

Similarly for having even length of two state DFA , initial state should be final state.