Home / Engineering / Theory of Computation / Question
M
Q.) Let L1 be a recursive language, and let L2 be a recursively enumerable but not a recursive language. Which one of the following is TRUE?
Related MCQs on Theory of Computation
Q. The SOM was a neural network model developed by__________.
Q. In case of OR gate, no matter what the number of inputs, a
Q. which one of the following can be erased using electricity
Q. What is the nature of the sentence: ∀x ∀y (TeacherOf(x,y) ⊃ StudentOf(y,x))
Q. How many numbers could ENIAC store in its internal memory
Q. Message ________ means privacy that the sender and reciever expect privacy.
Q. The important feature of the VLIW is ______?
Q. Data communication system spanning states, countries, or the whole world is ________
Discusssion
Login to discuss.