list all of the strings in

each of the languages below. A first example is provided for you. See the bottom of the page for

some reminders of definitions, etc.

$$ L $=\{0$

m$1$

n

$|$ m$,$ n in Z

nonneg, m $+$ n $=5\}$

$$ Answer: L $=\{00000,00001,00011,00111,01111,11111\}$

$($a$)$ L$1=\{0$

m$1$

n $|$ m$,$ n in Z

nonneg, n $<=2,$ m $<=$ n$\}$

$($b$)$ L$2=\{$a

mb

n $|$ m$,$ n in Z

nonneg

$,2<=$ n $<=6,$ n is a multiple of m$\}$

$($c$)$ L$3=\{$a

nb

$2$n$1$c

$3$n$2$

$|$ n in Z

$+,$ n $<=3\}$

$($d$)$ L$4=\{$w in $\{$a$,$ b$\}$

$$

$||$w$|<=3$ and w is a palindrome$\}$

$($A palindrome is a string that is the same backwards and forwards, such as radar, racecar,

sees, abbababba and a$.)$

Reminders:

$$ Z

nonneg is the set of nonnegative integers, $\{0,1,2,3,\}.$

Z

$+$ is the set of positive integers, $\{1,2,3,\}.$

$\{$a$,$ b$\}$

$$

is the set of all possible strings of $$a$$s and $$b$$s$,$ which includes the empty string $.$

$$ The notation $|$w$|$ represents the length of string w$.$

$$n is a multiple of m$$ means that n $=$ mk for some integer k$.$