Theory of Computation - Old Questions
3. Show that language of palindrome over {a,b} is not a regular language.
4 marks
|
Asked in 2068