Question 11
0 | 1 | B | |
q0 | q1, 1, R | q1, 1, R | Halt |
q1 | q1, 1, R | q0, 1, L | q0, B, L |
Question 12
L0 = {< M, w, 0 > | M halts on w} L1 = {< M, w, 1 > | M does not halts on w}Here < M, w, i > is a triplet, whose first component. M is an encoding of a Turing Machine, second component, w, is a string, and third component, i, is a bit. Let L = L0 ∪ L1. Which of the following is true ?
Question 14
1. L1\' (complement of L1) is recursive 2. L2\' (complement of L2) is recursive 3. L1\' is context-free 4. L1\' ∪ L2 is recursively enumerable
Question 15
Question 16
L1 Regular, L2: Context-free, L3: Recursive, L4: Recursively enumerable.Which of the following is/are TRUE?
I. L3\' U L4 is recursively enumerable II. L2 U L3 is recursive III. L1* U L2 is context-free IV. L1 U L2\' is context-free
Question 17
There are 29 questions to complete.