1
GATE CSE 1990
True or False
+1
-0
State whether the following statement is TRUE / FALSE.

A is recursive if both a and its complement are accepted by Turing Machine M accepts.

A
TRUE
B
FALSE
2
GATE CSE 1990
True or False
+1
-0
State whether the following statement is TRUE / FALSE.

The intersection of two $$CFL's$$ is also $$CFL.$$

A
TRUE
B
FALSE
3
GATE CSE 1990
True or False
+1
-0
State whether the following statement is TRUE / FALSE. The problem is to whether a Turing Machine M accepts input $$w$$ is un-decidable.

A
TRUE
B
FALSE
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
CBSE
Class 12