Home / Engineering / Theory of Computation / Question
M
Q.) Consider the following statements
I. Recursive languages are closed under complementation
II. Recursively enumerable languages are closed under union
III. Recursively enumerable languages are closed under complementation
Which of the above statement are TRUE?
Related MCQs on Theory of Computation
Q. A asymmetric-key (or public key ) cipher uses
Q. What is an internal sorting algorithm?
Q. Which of the following are supervised learning applications
Q. Which of the following is NOT a BITONIC Sequence
Q. When was Apple Macintosh II microcomputer introduced in the market?
Q. Thomson and Ritchie published a paper describing unix system in
Q. A ……….. is a graph that has weights of costs associated with its edges.
Q. Which of the following flip-flops is free from the race around the problem?
Q. p ↔ q is logically equivalent to
Q. Personnel who design, program, operates and maintains computer equipment refers to
Discusssion
Login to discuss.