The following Finite Automation recognizes which of the given languages?\n[Diagram: q0 (start) -> 0 -> q0, q0 -> 1 -> q1. q1 -> 0 -> q2 (final), q1 -> 1 -> q1. q2 -> 0 -> q2, q2 -> 1 -> q1.]
- A. $(1, 0)^*[01]$
- B. $(1, 0)^*[1]*[1]$
- C. $\{1\}\{1, 0\}^*\{1\}$
- D. $1^*0^*(0, 1)$
Answer: A. $(1, 0)^*[01]$
Explanation: The FA accepts strings ending in specific patterns. Analyzing state transitions shows it accepts strings ending in '10'.