-
A deterministic finite automata (DFA)D with alphabet ∑ = {a, b} is given below.
Which of the following finite state machines is a valid minimal DFA which accepts the same language as D?
Correct Option: A
As state (s) and (t) both are final states and accepting a* + b*, we can combine both states and we will get
