Back to the 2021 paper
Similar questions
FORMAL LANGUAGE & AUTOMATA THEORYState and prove the pumping lemma for regular languages.20217mFORMAL LANGUAGE & AUTOMATA THEORYProve the pumping lemma for regular languages.20247mFORMAL LANGUAGE & AUTOMATA THEORYState the pumping lemma for context-free languages.20237mFORMAL LANGUAGE & AUTOMATA THEORYWrite short notes on: Pumping lemma for CFL.20237m
PreviousLet G be a context-free grammar in Chomsky normal form that contains b variable. Show that if G generates some string using a derivation with at least 2^b steps, then L(G) is infinite.NextShow given grammar over alphabet \{a, b\}, verify whether it is ambiguous or unambiguous: S \to aSa \mid bSb \mid a \mid b \mid \epsilon