Year: 2018
Automata Theory Multiple Choice Quaestion & Answers (MCQs) set-41
1. A language L is said to be Turing decidable if: a) recursive b) TM recognizes L c) TM accepts…
Read More »Automata Theory Multiple Choice Quaestion & Answers (MCQs) set-40
1. The use of variable dependency graph is in: a) Removal of useless variables b) Removal of null productions c)…
Read More »Automata Theory Multiple Choice Quaestion & Answers (MCQs) set-39
1. Which of the following is called Bar-Hillel lemma? a) Pumping lemma for regular language b) Pumping lemma for context…
Read More »Automata Theory Multiple Choice Quaestion & Answers (MCQs) set-38
1. Fill in the blank with an appropriate option. In automata theory, ___________ is said to be Computationally Universal if…
Read More »Automata Theory Multiple Choice Quaestion & Answers (MCQs) set-37
1. The decision problem is the function from string to ______________ a) char b) int c) boolean d) none of…
Read More »Automata Theory Multiple Choice Quaestion & Answers (MCQs) set-36
1.The given regular language corresponds to which of the given regular language e+1+(1+0)*0+(0+1)*11 a) The language of all strings that…
Read More »Automata Theory Multiple Choice Quaestion & Answers (MCQs) set-35
1. A regular language over an alphabet a is one that can be obtained from a) union b) concatenation c)…
Read More »Automata Theory Multiple Choice Quaestion & Answers (MCQs) set-34
1. How many strings of length less than 4 contains the language described by the regular expression (x+y)*y(a+ab)*? a) 7…
Read More »Automata Theory Multiple Choice Quaestion & Answers (MCQs) set-33
1. The minimum length of a string {0,1}* not in the language corresponding to the given regular expression: (0*+1*)(0*+1*)(0*+1*) a)…
Read More »Automata Theory Multiple Choice Quaestion & Answers (MCQs) set-32
1. All set of polynomial questions which can be solved by a turing machine using a polynomial amount of space:…
Read More »