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. What is the other name for quick hull problem?
Q. Perform following subtraction (i) 11001-10110 using 1’s complement
Q. The communication mode that supports data in both directions at the same time is
Q. Using FTP, working directory on the remote host can be changed using the command .
Discusssion
Login to discuss.