If L1 and L2 are context free languages, L1 - L2 is ___________ contex — PYQDeck

PyQdeckBEU PYQ Archive Subjects

Back to the 2022 paper

Module 2: Context-free languages and pushdown automata

20222m

If $L1$ and $L2$ are context free languages, $L1 - L2$ is ___________ context-free.
(i) always
(ii) sometimes
(iii) never
(iv) None of these

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 the above20212m FORMAL LANGUAGE & AUTOMATA THEORYIf L_1 and L_2 are CFLs, L_1 - L_2 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 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

PreviousThe logic of pumping lemma is a good example of (i) pigeon-hole principle (ii) divide-and-conquer technique (iii) recursion (iv) iteration Next___________ is the acyclic graphical representation of a grammar (i) Binary tree (ii) Octtree (iii) Parse tree (iv) None of the above