Teaching Haryana (HPSC) Assistant Professor Mock Test 2025 Theory of Computation Regular Languages and Finite Automata Finite Automata
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 language as D?
1
2
3
4
5
Question Not Attempted