(d) L = {a n b l : n ≤ l}.
(e) L = {w: n a (w) ≠ n b (w) }.
(f) L = {ww : w ∈{a, b}*}.
(g) L = {www R : w ∈ {a, b}*}.
5. Determine whether or not the following languages on Σ = {a} are regular.
(a) L = {a n : n ≥ 2, is a prime number}.
(b) L = {a n : n is not a prime number}.
(c) L = {a n : n = k 3 for some k ≥ 0}.
(d) L = {a n : n = 2 k for some k ≥ 0}.
(e) L = {a n : n is the product of two prime numbers}.
(f) L = {a n : n is either prime or the product of two or more prime numbers}.
(g)
, where L is the language in part (a).
6. Determine whether or not the following languages are regular.
7. Show that the language
is not regular.
* 8. Show that the language
is not regular.
9. Is the language
regular?
10. Consider the language