Paper 4, Section I,
(a) Which of the following are regular languages? Justify your answers.
(i) .
(ii) contains an odd number of 's and an even number of 's .
(iii) contains no more than 7 consecutive 0 's .
(b) Consider the language over alphabet defined via
Show that satisfies the pumping lemma for regular languages but is not a regular language itself.
Typos? Please submit corrections to this page on GitHub.