1
GATE CSE 2008
MCQ (Single Correct Answer)
+2
-0.6
Which of the following statement is false?
A
Every $$NFA$$ can be converted to an equivalent $$DFA$$
B
Every non-deterministic Turing machine can be converted to an equivalent deterministic Turing machine.
C
Every regular language is also a context- free language
D
Every subset of a recursively enumerable set is recursive
2
GATE CSE 2008
MCQ (Single Correct Answer)
+2
-0.6
Which of the following are regular sets? GATE CSE 2008 Theory of Computation - Finite Automata and Regular Language Question 55 English
A
$${\rm I}$$ & $${\rm I}V$$ only
B
$${\rm I}$$ & $${\rm III}$$ only
C
$${\rm I}$$ only
D
$${\rm I}V$$ only
3
GATE CSE 2008
MCQ (Single Correct Answer)
+2
-0.6
Match the following $$NFAs$$ with the regular expressions they correspond to GATE CSE 2008 Theory of Computation - Finite Automata and Regular Language Question 56 English 1 GATE CSE 2008 Theory of Computation - Finite Automata and Regular Language Question 56 English 2 GATE CSE 2008 Theory of Computation - Finite Automata and Regular Language Question 56 English 3 GATE CSE 2008 Theory of Computation - Finite Automata and Regular Language Question 56 English 4 GATE CSE 2008 Theory of Computation - Finite Automata and Regular Language Question 56 English 5
A
$$P - 2,\,Q - 1,\,R - 3,\,S - 4$$
B
$$P - 1,\,Q - 3,\,R - 2,\,S - 4$$
C
$$P - 1,\,Q - 2,\,R - 3,\,S - 4$$
D
$$P - 3,\,Q - 2,\,R - 1,\,S - 4$$
4
GATE CSE 2008
MCQ (Single Correct Answer)
+2
-0.6
Given below are two finite state automata ($$ \to $$ indicates the start state and $$F$$ indicates a final state) GATE CSE 2008 Theory of Computation - Finite Automata and Regular Language Question 57 English 1 GATE CSE 2008 Theory of Computation - Finite Automata and Regular Language Question 57 English 2

Which of the following represents the product automation $$ZY$$?

A
GATE CSE 2008 Theory of Computation - Finite Automata and Regular Language Question 57 English Option 1
B
GATE CSE 2008 Theory of Computation - Finite Automata and Regular Language Question 57 English Option 2
C
GATE CSE 2008 Theory of Computation - Finite Automata and Regular Language Question 57 English Option 3
D
GATE CSE 2008 Theory of Computation - Finite Automata and Regular Language Question 57 English Option 4
EXAM MAP
Medical
NEETAIIMS
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
Defence
NDA
Staff Selection Commission
SSC CGL Tier I
CBSE
Class 12