Back to the 2021 paper
Similar questions
Formal Language & Automata TheoryIf L1 and L2 are context free languages, L1 - L2 is ___________ context-free. (i) always (ii) sometimes (iii) never (iv) None of these20222mFormal Language & Automata TheoryIf L1 and L2 are context-free languages, L1-L2 is \_\_\_\_ context-free. (i) always (ii) sometimes (iii) never (iv) None of the above20212mFORMAL LANGUAGE & AUTOMATA THEORYWhich one of the following statements is true? (i) The intersection of two CFLs is context-free (ii) Every CFL can be accepted by a DPDA (iii) The union of two CFLs is context-free (iv) The complement of a CFL is context-free20232mFORMAL LANGUAGE & AUTOMATA THEORYSuppose L is CFL and R is regular: (i) Is L - R always CFL? (ii) Is R - L always CFL?202114m
PreviousThe maximum number of states of a DFA converted from an NFA with n states is: (i) n (ii) n^2 (iii) 2^n (iv) None of the aboveNextWhich of the following does not have left recursion? (i) Chomsky Normal Form (ii) Greibach Normal Form (iii) Backus–Naur Form (iv) All of the above
Budget AppAndroid App
Pocketly on Android
Log daily food, travel, and hostel expenses instantly. Set monthly spending limits and see where your money goes without complex spreadsheets.