Home / Engineering / Theory of Computation / Question
M
Q.) If L1 and L2 are context free language and R a regular set, then which one of the languages below is not necessarily a context free language?
Related MCQs on Theory of Computation
Q. If there is only a discrete number of possible outcomes called .
Q. At which time does the static_cast can be applied?
Q. A Microsoft Windows is .....a(n)
Q. Which of the following is NOT a standard related to testing?
Q. R is a relation from {11, 12, 13} to {8, 10, 12} defined by y = x – 3. The relation R – 1 is
Q. The VC#.NET language________________.
Q. In RSA, ะค(n) = _______ in terms of p and q.
Q. specification defining the PHY and MAC layer of low power devices.
Discusssion
Login to discuss.