Year: 2018
Automata Theory Multiple Choice Quaestion & Answers (MCQs) set-31
1. Complement of regular sets are _________ a) Regular b) CFG c) CSG d) RE 2. Which of the following…
Read More »Automata Theory Multiple Choice Quaestion & Answers (MCQs) set-30
1. The minimum number of states required to automate the following Regular Expression: (1) *(01+10) (1) * a) 4 b)…
Read More »Automata Theory Multiple Choice Quaestion & Answers (MCQs) set-29
1. Number of final state require to accept F in minimal finite automata. a) 1 b) 2 c) 3 d)…
Read More »Automata Theory Multiple Choice Quaestion & Answers (MCQs) set-28
1. All the regular languages can have one or more of the following descriptions: i) DFA ii) NFA iii) e-NFA…
Read More »Automata Theory Multiple Choice Quaestion & Answers (MCQs) set-27
1. According to the given transitions, which among the following are the epsilon closures of q1 for the given NFA?…
Read More »Automata Theory Multiple Choice Quaestion & Answers (MCQs) set-26
1. How many languages are over the alphabet R? a) countably infinite b) countably finite c) uncountable finite d) uncountable…
Read More »Automata Theory Multiple Choice Quaestion & Answers (MCQs) set-25
1. The number of elements in the set for the Language L={x?(?r) *|length if x is at most 2} and…
Read More »Automata Theory Multiple Choice Quaestion & Answers (MCQs) set-24
1. Given Language: L= {ab U aba}* If X is the minimum number of states for a DFA and Y…
Read More »Automata Theory Multiple Choice Quaestion & Answers (MCQs) set-23
1. A randomized algorithm uses random bits as input inorder to achieve a _____________ good performance over all possible choice…
Read More »Automata Theory Multiple Choice Quaestion & Answers (MCQs) set-22
1. Which of the following are basic complexity classes for a function f:N->N? a) Ntime(f) b) Nspace(f) c) Space(f) d)…
Read More »