GATE Computer Science (CS) 2011 Solved Paper
© examsiri.com
Question : 55 of 65
Marks:
+1,
-0
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?
Which of the following finite state machines is a valid minimal DFA which accepts the same language as D?
Go to Question: