Computer Science, asked by sabamunawwarsiddiqui, 8 months ago

Show that the following languages are not context-free (using the Pumping Lemma for context free languages).

a. \{a^i b^j c^k \mid i> j> k\}

b. \{a^i \mid \text{i is prime} \}​

Answers

Answered by kanishkasaini11
0

Answer:

please follow me and like me

Similar questions