Suppose L is CFL and R is regular: (i) Is L - R always CFL? (ii) Is R — PYQDeck

PyQdeckBEU PYQ Archive Subjects

Back to the 2021 paper

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

202114m

Suppose $L$ is CFL and $R$ is regular:

(i) Is $L - R$ always CFL?
(ii) Is $R - L$ always CFL?

Search Google Ask AI

Similar questions

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 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 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 these20222m

PreviousUsing the CYK algorithm, determine whether baaba is in L(G) for the grammar: `` S → AB | BC A → BA | a B → CC | b C → AB | a ``NextShow that the language: L = \{ a^{n!} : n \ge 0 \} is not regular or not context-free.