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

PYQ GATE 2011

A deterministic finite automaton (DFA) DD with alphabet Σ={a,b}Σ=\{a,b\} is given below.

Which of the following finite state machines is a valid minimal DFA which accepts the same languages as DD?

Attempted by 342 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…