(1) For each of the following languages, say whether it is context-free. If so, write a...

  

Transcribed Image Text:

(1) For each of the following languages, say whether it is context-free. If so, write a CFG or draw a PDA (non-mathematically) that generates the language. If not, prove it using the pumping lemma and/or closure properties for CFLs. (a) (5 pts) L = {an | n 0}. (b) (5 pts) L = {abc(m-n) | m>n} (c) (10 pts) L = {amben | m,n>0} (d) (10 pts) L= {a"b"c" | m>n} (1) For each of the following languages, say whether it is context-free. If so, write a CFG or draw a PDA (non-mathematically) that generates the language. If not, prove it using the pumping lemma and/or closure properties for CFLs. (a) (5 pts) L = {an | n 0}. (b) (5 pts) L = {abc(m-n) | m>n} (c) (10 pts) L = {amben | m,n>0} (d) (10 pts) L= {a"b"c" | m>n}