Back to the 2022 paper
Similar questions
FORMAL LANGUAGE & AUTOMATA THEORYProve that if L_1 and L_2 are regular, then L_1 \cup L_2 is regular.20237mFormal 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 THEORYSuppose L is CFL and R is regular: (i) Is L - R always CFL? (ii) Is R - L always CFL?202114mFormal 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