Automata MCQ
Automata Theory Multiple Choice Quaestion & Answers (MCQs) set-45
1. What does NP stands for in complexity classes theory? a) Non polynomial b) Non-deterministic polynomial c) Both (a) and…
Read More »Automata Theory Multiple Choice Quaestion & Answers (MCQs) set-44
1. Which of the expressions correctly is an requirement of the pumping lemma for the context free languages? a) uvnwxny…
Read More »Automata Theory Multiple Choice Quaestion & Answers (MCQs) set-43
1. X is a simple mathematical model of a computer. X has unrestricted and unlimited memory. X is a FA…
Read More »Automata Theory Multiple Choice Quaestion & Answers (MCQs) set-42
1. Which of the given problems are NP-complete? a) Node cover problems b) Directed Hamilton Circuit Problem c) Both (a)…
Read More »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 »