Back to the 2023 paper
Similar questions
FORMAL LANGUAGE & AUTOMATA THEORYGive examples of L_1 and L_2 such that: (i) L_1 is regular, L_2 is not regular, and L_1 - L_2 is regular. (ii) L_1 and L_2 are not regular but L_1 \cup L_2 is regular.20227mFORMAL 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 TheoryShow that L = \text{palindrome over } \{a, b\} is not regular.20197mFORMAL LANGUAGE & AUTOMATA THEORYProve the pumping lemma for regular languages.20247m