Automata MCQ
-
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 » -
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 »