5 Automata Define Language 01 10 10 01 Note B D Use Transitions Strings May Assume Nonacce Q37118285

Please answer the question in detail so I can understandclearly. Thank you.

5. Which automata define the same language? 01 10 10 01 Note: (b) and (d) use transitions on strings. You may assume that there are nonaccepting intermediate states, not shown, that are in the middle of these transitions, or just accept the extension to the conventional finite automaton that allows strings on transitions and, like the conventional FA accepts strings that are

OR

 

OR