This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “Intersection with Regular Languages”. 1. Which of the following is not a negative property of Context free languages? a) Intersection b) Complement c) Intersection and Complement d) None of the mentioned 2. The intersection of context free language and regular language is … Read more
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “CFL- Other Normal Forms”. 1. The following format of grammatical notation is accepted by which of the following: AB->CD A->BC or A->B or A->a where A, B, C, D are non terminal symbols and a is a terminal symbol. a) Greibach Normal … Read more
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “CFL- Closure Properties/Decision Properties”. 1. The context free languages are closed under: a) Intersection b) Complement c) Kleene d) None of the mentioned 2. Given Grammar G1: S->aSb S->e Grammar G2: R->cRd R->e If L(G)=L(G1) U L(G2), the number of productions the … Read more
This set of Automata Theory Questions and Answers for Campus interviews focuses on “Pumping Lemma for Context Free Language”. 1. Which of the following is called Bar-Hillel lemma? a) Pumping lemma for regular language b) Pumping lemma for context free languages c) Pumping lemma for context sensitive languages d) None of the mentioned 2. Which … Read more
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “Chomsky Normal Form”. 1. The format: A->aB refers to which of the following? a) Chomsky Normal Form b) Greibach Normal Form c) Backus Naur Form d) None of the mentioned 2. Which of the following does not have left recursions? a) Chomsky … Read more
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “Eliminating Unit Productions”. 1. Which of the following is the format of unit production? a) A->B b) A->b c) B->Aa d) None of the mentioned 2. Given Grammar G: S->aA A->a| A B->B The number of productions to be removed immediately as … Read more
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “Eliminating Epsilon Productions”. 1. The use of variable dependency graph is in: a) Removal of useless variables b) Removal of null productions c) Removal of unit productions d) None of the mentioned 2. The variable which produces an epsilon is called: a) … Read more
This set of Automata Theory Assessment Questions and Answers focuses on “CFG-Eliminating Useless Symbols”. 1. Suppose A->xBz and B->y, then the simplified grammar would be: a) A->xyz b) A->xBz|xyz c) A->xBz|B|y d) none of the mentioned 2. Given Grammar: S->A, A->aA, A->e, B->bA Which among the following productions are Useless productions? a) S->A b) A->aA … Read more
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “DPDA and Ambiguous Grammars”. 1. CFGs are more powerful than: a) DFA b) NDFA c) Mealy Machine d) All of the mentioned 2. State true or false: S-> 0S1|01 Statement: No regular expression exists for the given grammar. a) true b) false … Read more
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “DPDA and Context Free Languages”. 1. Context free grammar is called Type 2 grammar because of ______________ hierarchy. a) Greibach b) Backus c) Chomsky d) None of the mentioned 2. a→b Restriction: Length of b must be atleast as much length of … Read more
