Automata Theory Objective Questions

Automata Theory test on “Finite Automata with Epsilon Transition”. 1. According to the given transitions, which among the following are […]

Automata Theory Multiple Choice Questions on “Pumping Lemma for Regular Language”. 1. Relate the following statement: Statement: All sufficiently long

Automata Theory Multiple Choice Questions on “PDA-acceptance by Empty Stack”. 1. If two sets, R and T has no elements

Automata Theory Multiple Choice Questions on “The Language of Turing Machine”. 1. A turing machine that is able to simulate

Automata Theory Multiple Choice Questions on “Randomized Algorithm” 1. A randomized algorithm uses random bits as input inorder to achieve

Automata Theory Multiple Choice Questions on “Uses of Epsilon-Transitions”. 1. The automaton which allows transformation to a new state without

Automata Theory Multiple Choice Questions on “Applications of Pumping Lemma/Pigeonhole principle”. 1. Which kind of proof is used to prove

Basic Automata Theory Questions and Answers on “From Grammars to Push Down Automata”. 1. The production of the form A->B

Automata Theory Questions and Answers for Freshers on ” The Language of Turing Machine″. 1. The class of recursively ennumerable

Automata Theory Multiple Choice Questions on “Complexity Classes,Class RP and ZPP”. 1. Which among the following is smallest for n=50

Automata Theory Multiple Choice Questions on “Finite Automata-Introduction”. 1. Assume the R is a relation on a set A, aRb

Automata Theory Multiple Choice Questions on “Epsilon Closures”. 1. Which of the following does not belong to input alphabet if

Automata Theory online test on “Closure Properties under Boolean Operations”. 1. If L1, L2 are regular and op(L1, L2) is

Automata Theory Multiple Choice Questions on “From PDA to Grammars”. 1. The instantaneous PDA is has the following elements a)

Automata Theory Multiple Choice Questions on “Turing Machine and Halting”. 1. The machine accept the string by entering into hA