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 THEORYSuppose L is CFL and R is regular: (i) Is L - R always CFL? (ii) Is R - L always CFL?202114mFormal 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?202114mFormal Language & Automata TheoryLet \Sigma = \{0, 1\}. Let L be the language that consists of strings having either 01 repeated one or more times or 010 repeated one or more times. Is L regular? Explain.20197m
PreviousShow whether the given grammar is ambiguous: S \to a \mid abSb \mid aAb \\ A \to bS \mid aAAbNextShow that the language of palindromes over \{a, b\} is not regular.
Student FinanceWeb Platform
Pocketly — Personal Finance for Students
Keep your hostel and college expenses under control. Track accounts, log spending in seconds, and stay within your monthly budget.