Answer

(a) The machine has two states. The start state is accepting, and the other state is not. The transition function takes only one value, namely the second - nonaccepting - state. Nonaccepting states like this - from which there is no escape - I tend to write with a scowlie.

(b) The machine has one state, and that is a nonaccepting state (a scowlie).


Back to exercises