Theory-of-Computation
January 3, 2025GATE 2011
January 3, 2025Theory-of-Computation
| Question 19 |
A deterministic finite automation (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?
 | |
 | |
 | |
 |
Question 19 Explanation:
(A) True.
(B) False, as it accepts string ‘b’, which is not accepted by original DFA.
(C) Same reason as (B).
(D) False, as it accepts string ‘bba’ which is not accepted by the given DFA.
(B) False, as it accepts string ‘b’, which is not accepted by original DFA.
(C) Same reason as (B).
(D) False, as it accepts string ‘bba’ which is not accepted by the given DFA.
Correct Answer: A
Question 19 Explanation:
(A) True.
(B) False, as it accepts string ‘b’, which is not accepted by original DFA.
(C) Same reason as (B).
(D) False, as it accepts string ‘bba’ which is not accepted by the given DFA.
(B) False, as it accepts string ‘b’, which is not accepted by original DFA.
(C) Same reason as (B).
(D) False, as it accepts string ‘bba’ which is not accepted by the given DFA.