If L_1 and L_2 are CFLs, L_1 - L_2 is ____ context-free. (i) always (i — PYQDeck

PyQdeckBEU PYQ Archive Subjects

Back to the 2021 paper

Module 2: Context-Free Languages (CFL) and PDA

20212m

If $L_1$ and $L_2$ are CFLs, $L_1 - L_2$ is ____ context-free.

(i) always
(ii) sometimes
(iii) never
(iv) None of the above

Search Google Ask AI

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 these20222m FORMAL 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-free20232m 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 the above20212m Formal Language & Automata TheorySuppose L is context free and R is regular, justify your answer with the help of example: (i) Is L-R necessarily context free? (ii) Is R-L necessarily context free?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 above NextWhich 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