1
GATE CSE 2011
MCQ (Single Correct Answer)
+2
-0.6
A deterministic finite automation $$(DFA)$$ $$D$$ with alphabet $$\sum { = \left\{ {a,b} \right\}} $$ is given below GATE CSE 2011 Theory of Computation - Push Down Automata and Context Free Language Question 21 English

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

A
GATE CSE 2011 Theory of Computation - Push Down Automata and Context Free Language Question 21 English Option 1
B
GATE CSE 2011 Theory of Computation - Push Down Automata and Context Free Language Question 21 English Option 2
C
GATE CSE 2011 Theory of Computation - Push Down Automata and Context Free Language Question 21 English Option 3
D
GATE CSE 2011 Theory of Computation - Push Down Automata and Context Free Language Question 21 English Option 4
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12