PyQdeck LogoPyQdeckSubjects
Back to the 2022 paper

Module 1: Introduction, Regular languages and finite automata

20222m

The logic of pumping lemma is a good example of
(i) pigeon-hole principle
(ii) divide-and-conquer technique
(iii) recursion
(iv) iteration

Search GoogleAsk AI

Similar questions

Design & Analysis of AlgorithmsThe approach followed in Floyd Warshall's algorithm is - (i) Greedy approach - (ii) Dynamic approach - (iii) Backtracking - (iv) Divide and conquer20242mDesign and Analysis of Algorithms Write a short note on: Recursion tree method20257mFormal Language & Automata TheoryWhich of the following is used to prove many undecidability results? (i) Pumping Lemma (ii) Rice's Theorem (iii) Chomsky Normal Form (iv) Subset Construction20252mDesign & Analysis of AlgorithmsDiscuss the steps in mathematical analysis for recursive algorithm. Do the same for finding the factorial of a number?20197m
PreviousWhich of the following pairs have DIFFERENT expressive powers? (i) Deterministic finite automata (DFA) and non-deterministic finite automata (NDFA) (ii) Deterministic push-down automata (DPDA) and non-deterministic push-down automata (NDPDA) (iii) Deterministic single-tape Turing machine and non-deterministic single-tape Turing machine (iv) Single-tape Turing machine and multi-tape Turing machineNextIf L1 and L2 are context free languages, L1 - L2 is ___________ context-free. (i) always (ii) sometimes (iii) never (iv) None of these