Prove that this is not a
Regular language using the
pumping lemma
L = {a^n : n is prime}
Answers
Answered by
1
Answer:
sorry I don't know I don't study this
Similar questions