For a complete DFA, exchanging accepting and nonaccepting states recognizes the complement. State distinguishability is preserved because any suffix separating two states before complementation still separates them afterwards. Thus the complement’s minimal DFA has exactly k states, C.
More Regular Expressions and Finite Automata questions
GATE 2021 CS (CS2) Q27– For the DFA shown, how many binary strings of length eight are accepted?
GATE 2021 CS (CS2) Q57– Which regular expressions denote the binary numbers divisible by three? Leading zeros are…
GATE 2026 CS (CS1) Q26– Let M be a nondeterministic finite automaton (NFA) with 6 states over a finite alphabet.…
GATE 2026 CS (CS1) Q51– Let L 1 and L 2 be two languages over a finite alphabet, such that L 1 L 2 and L 2 are…
GATE 2026 CS (CS2) Q47– Consider the following two finite automata D 1 and D 2. Which of the following statements…
GATE 2025 CS (CS1) Q28– A regular language L is accepted by a non-deterministic finite automaton (NFA) with n…