31. | Consider a language L for which there exists a Turing machine (TM), T, that accepts every word in Land either rejects or loops for every word that is not in L. The language L is
|
32. | Consider the following statements
Which of the above statement are TRUE?
|
33. | Which of the following statement is wrong?
|
34. | Recursively enumerable languages are not closed under
|
35. | Which of the following problem is undecidable?
|
36. | Recursive languages are
|
37. | R1 and R2 are regular sets. Which of the following is not true?
|
38. | Which of the following regular expression identity is true?
|
39. | Which one of the following statement is FALSE?
|
40. | Which of the following conversion is not possible (algorithmically)?
|
31. | d |
32. | b |
33. | d |
34. | c |
35. | d |
36. | a |
37. | a |
38. | b |
39. | c |
40. | c |
ReplyDeleterich in knowledge
This comment has been removed by the author.
ReplyDelete