Theory of Computation - Old Questions
6. Show that L = {an | n is a prime number} is not a regular language.
5 marks
|
Asked in 2078