Time Left - 06:00 mins
NIELIT Scientist –B Day-15 : Theory of computation Quiz-2
Attempt now to get your rank among 514 students!
Question 1
Find the solution for the following instance of post correspondence problem
,,,,,
,,,,,
Question 2
For a context-free Grammar G, to determine whether if G is ambiguous is?
Question 3
Choose the correct statement
Question 4
Assume X1 will always be the symbol 0, X2 will be 1, and X3 will be B, the blank
Refer the direction L as and direction R as
Encode the transition rule,
(, ) = (, ) for some integers i, j, k, l, m by the string
Let the TM M =
If the transition function 𝛿 of a given TM consists of the rules
q1
(q1, 1) = (q3, 0, R)
(q1, 0) = (q2, 1, R)
(q2, B) = (q3, 1, R)
(q3, B) = (q3, 1, L)
Then which of the following is a valid code of a transition rule of the TM?
Refer the direction L as and direction R as
Encode the transition rule,
(, ) = (, ) for some integers i, j, k, l, m by the string
Let the TM M =
If the transition function 𝛿 of a given TM consists of the rules
q1
(q1, 1) = (q3, 0, R)
(q1, 0) = (q2, 1, R)
(q2, B) = (q3, 1, R)
(q3, B) = (q3, 1, L)
Then which of the following is a valid code of a transition rule of the TM?
Question 5
Pumping lemma is generally used for proving :
- 514 attempts
- 4 upvotes
- 4 comments
Apr 2GATE & PSU CS