Section 1.3
1. (a)

is one such list.
(c)

is one such list.
(g)

is one such list.
2. (c)

(d)

3. (a)

is one such list.
(b)

is one such list.
(c)

is one such list.
The sets in parts (a) and (b) contain the empty word

;
the set in part (c) does not since

8. (c)

10. (a)

(b)

(c)

(d)

(e)

(f)

13. (a)

belongs to

and

.
In each case its length is

.
(b)

belongs to

only. Its length is

.
(c)

belongs to

only. Its length is

.
(d)

belongs to

and

.
Its length in

is

while its length in

is

(e)

belongs to

and

.
Its length in

is

while its length in

is

(f)

belongs to

only. Its length is

14. You would never arrive at the word

in this dictionary assuming that you had to go
through all the words prior to it first. That's because there are infinitely many words prior
to it, e.g.

etc ...
To figure
out how far you would have to dig to get

in case the dictionary contained only words
of length 5 or less ... Let's count the words appearing before

.
These must start with the letter

,
or be
just the single letter

itself. How many words start with

There is one of length 1 (just

),
2 of length 2

and

),
4 of length 3
(
,
8 of length 4 (you can list them if you want) and 16 of
length 5. Thus the number of words appearing before

in this special dictionary is 1+2+4+8+16+1 = 32.
So

is the 33rd word in this dictionary.
This document created by Scientific Notebook 4.1.