Home / Engineering / Theory of Computation / Question
M
Q.) How many states are present in the minimum state finite automaton that recognizes the language represented by the regular expression (0+1)(0+1)…..N times?
Related MCQs on Theory of Computation
Q. Under what case of Master’s theorem will the recurrence relation of stooge sort fall?
Q. Expression into postfix expression: (A - B) * (D / E)
Q. Digitizing the image intensity amplitude is called
Q. Which of the following errors should not be tested when error handling is evaluated?
Q. Third era of computing is known as the …….
Q. Any subset of a frequent set is a frequent set. This is_________
Q. Which of the following algorithms are probably correct as well as fast?
Q. Which of the following operation retrieves the newest version of the object?
Discusssion
Login to discuss.