1. A PCP problem is solvable if
a) |∑| = 1
b) |∑| = 4
c) |∑| = 2
d) None of these
2. A recursive language is also called
a) Decidable
b) Undecidable
c) Both (a) and (b)
d) None of these
3. The complement of recursive language is
a) Also recursive
b) Regular
c) Both (a) and (b)
d) None of these
4. Which of the following statement is
true?
a) The union of two recursively
enumerable language is recursively enumerable
b) Let L1 and L2 are two recursive language then the
union of L1 and L2 i.e. L1 U L2 is
also recursive
c) If a language L and its complement L-I
are both recursively enumerable then L is recursive language
d) None of these
5. Recursively enumerable language are
closed under
a) Concatenation
b) Intersection
c) Union
d) All of these
6. Recursive languages are
a) Accepted by turing machine
b) Accepted by finite automata
c) Both (a) and (b)
d) None of these