Identify which automata define the same language and provide the correct counterexample if they don't. Choose the correct statement from the list below.

		a)	(c) and (f) define the same language.
		b)	(a) and (c) define the same language.
		c)	(c) and (b) do not define the same language and the following counterexample shows it. String 0012 is accepted by one and not by the other.
		d)	(b) and (f) define the same language.

5.	Here is a nondeterministic finite automaton: Some input strings lead to more than one state. Find, in the list below, a string that leads from the start state A to three different states (possibly including A).

4. Identify which automata define the same language and provide the correct counterexample if they don't. Choose the correct statement from the list below. a) (c) and (f) define the same language. b) (a) and (c) define the same language. c) (c) and (b) do not define the same language and the following counterexample shows it. String 0012 is accepted by one and not by the other. d) (b) and (f) define the same language. 5. Here is a nondeterministic finite automaton: Some input strings lead to more than one state. Find, in the list below, a string that leads from the start state A to three different states (possibly including A). a) 1010 b) 00100 c) 101000 d) 1000