1
GATE CSE 2000
MCQ (Single Correct Answer)
+2
-0.6
Consider the following decision problems:
$${P_1}$$ Does a given finite state machine accept a given string
$${P_2}$$ Does a given context free grammar generate an infinite number of stings.

Which of the following statements is true?

A
Both $${P_1}$$ and $${P_2}$$ are decidable
B
Neither $${P_1}$$ and $${P_2}$$ are decidable
C
Only $${P_1}$$ is decidable
D
Only $${P_2}$$ is decidable
2
GATE CSE 1999
MCQ (More than One Correct Answer)
+2
-0.6
If $${L_1}$$ is a context free language and $${L_2}$$ is a regular which of the following is/are false?
A
$${L_1} - {L_2}$$ is not context free
B
$${L_1} \cap {L_2}$$ is context free
C
$$ \sim {L_1}$$ is context free
D
$$ \sim {L_2}$$ is regular
3
GATE CSE 1998
MCQ (Single Correct Answer)
+2
-0.6
Let $$L$$ be the set of all binary strings whose last two symbols are the same. The number of states in the minimum state deterministic finite-state automation accepting $$L$$ is
A
$$2$$
B
$$5$$
C
$$8$$
D
$$3$$
4
GATE CSE 1998
MCQ (Single Correct Answer)
+2
-0.6
Which of the following statements is false?
A
Every finite subset of a non-regular set is regular
B
Every subset of a regular set is regular
C
Every finite subset of a regular set is regular
D
The intersection of two regular sets is regular
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
Defence
NDA
CBSE
Class 12