Theory of Computation MCQs | Page - 3
Dear candidates you will find MCQ questions of Theory of Computation here. Learn these questions and prepare yourself for coming examinations and interviews. You can check the right answer of any question by clicking on any option or by clicking view answer button.
M
Q. Which of the following is not a regular expression?
M
Q. Consider the regular language L = (111+111111)*. The minimum number of states inany DFA accepting this language is
M
Q. How many strings of length less than 4 contains the language described by the regular expression (x+y)*y(a+ab)*?
M
Q. Which of the following denotes Chomskianhiearchy?
M
Q. The concept of FSA is much used in this part of the compiler
M
Q. The following grammar G = (N, T, P, S)**spaceN = {S, A, B, C, D, E}**spaceT = {a, b, c}**spaceP : S → aAB**spaceAB → CD**spaceCD → CE**spaceC → aC**spaceC → b**spacebE → bc is
M
Q. The following CFG is in S → aBB**spaceB → bAA**spaceA → a**spaceB → b
M
Q. Which of the following statements is wrong?
M
Q. Context free grammar is not closed under
Jump to
Download our easy to use, user friendly Android App from Play Store. And learn MCQs with one click.
