Theory of Computation - Old Questions
7. Show that language L={0m1m | m>=1} is not a regular language.
5 marks
|
Asked in 2076 (new)