A deterministic finite automaton (DFA) $D$ with alphabet $Σ=\{a,b\}$ is…

GATE · 2011 · CS · Computer Science & IT

A deterministic finite automaton (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 languages as $D$ ?

Attempted by 294 students.

A deterministic finite automaton (DFA) \(D\) with alphabet \(Σ=\{a,b\}\) is…