Math, asked by kavyagopineni9, 5 hours ago


Prove that this is not a
Regular language using the
pumping lemma
L = {a^n : n is prime}​

Answers

Answered by khwaishsarraf
1

Answer:

sorry I don't know I don't study this

Similar questions