Automata MCQ
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 »Automata Theory Multiple Choice Quaestion & Answers (MCQs) set-21
1. The minimum number of states required to recognize an octal number divisible by 3 are/is a) 1 b) 3…
Read More »Automata Theory Multiple Choice Quaestion & Answers (MCQs) set-20
1. What kind of expressions do we used for pattern matching? a) Regular Expression b) Rational Expression c) Regular &…
Read More »Automata Theory Multiple Choice Quaestion & Answers (MCQs) set-19
1. Which of the following conversion is not feasible? a) Regular expression to automaton conversion b) Automaton to Regular Expression…
Read More »Automata Theory Multiple Choice Question & Answers (MCQs) set-18
1. Which of the following options is correct? Statement 1: Initial State of NFA is Initial State of DFA. Statement…
Read More »Automata Theory Multiple Choice Question & Answers (MCQs) set-17
1. XML is a _________ markup language. a) meta b) beta c) octa d) peta 2. Which of the following…
Read More »Automata Theory Multiple Choice Question & Answers (MCQs) set-16
1. If L1, L2 are regular and op(L1, L2) is also regular, then L1 and L2 are said to be…
Read More »