Suppose L is context free and R is regular, justify your answer with t — PYQDeck

PyQdeckBEU PYQ Archive Subjects

Back to the 2021 paper

Module 2: Context-free languages and pushdown automata

202114m

Suppose $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?

Search Google Ask AI

Similar questions

FORMAL LANGUAGE & AUTOMATA THEORYSuppose L is CFL and R is regular: (i) Is L - R always CFL? (ii) Is R - L always CFL?202114m 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 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 TheoryIf L1 and L2 are context-free languages, L1-L2 is \_\_\_\_ context-free. (i) always (ii) sometimes (iii) never (iv) None of the above20212m

PreviousConsider the grammar: S \to AB \mid BC A \to BA \mid a B \to CC \mid b C \to AB \mid a Use the CYK algorithm to determine whether the given string "baaba" is in L(G) or not.NextShow that the language L = \{a^{n!} : n \ge 0\} is not regular or not context-free language.