Which automata define the same language?
Note: (b) and (d) use transitions on strings. You may assume that there are non-accepting 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 the concatenation of labels along any path from the start state to an accepting state.
-
a) c and d
-
b) a and c
-
c) b and d
-
d) a and d
