Home / Engineering / Theory of Computation MCQs / Page 3
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. 21) A language is regular if and only if
M
Q. 22) Which of the following is not a regular expression?
M
Q. 23) Consider the regular language L = (111+111111)*. The minimum number of states inany DFA accepting this language is
M
Q. 24) How many strings of length less than 4 contains the language described by the regular expression (x+y)*y(a+ab)*?
M
Q. 25) Which of the following denotes Chomskianhiearchy?
M
Q. 26) The concept of FSA is much used in this part of the compiler
M
Q. 27) 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. 28) The following CFG is in S → aBB**spaceB → bAA**spaceA → a**spaceB → b
M
Q. 29) Which of the following statements is wrong?
M
Q. 30) Context free grammar is not closed under
Explore Sets
Theory of Computation MCQs Set 1
Theory of Computation MCQs Set 2
Theory of Computation MCQs Set 3
Theory of Computation MCQs Set 4
Theory of Computation MCQs Set 5
Theory of Computation MCQs Set 6
Theory of Computation MCQs Set 7
Theory of Computation MCQs Set 8
Theory of Computation MCQs Set 9
Theory of Computation MCQs Set 10
Theory of Computation MCQs Set 11
Theory of Computation MCQs Set 12
Theory of Computation MCQs Set 13
Explore More Categories
Click on category to learn MCQs of that category.Electronics and Communication Engineering
Download our easy to use, user friendly Android App from Play Store. And learn MCQs with one click.
