Follow the letters printed on a ticket and walk along the
lines to the correct places in the machine.
Recognize that certain words are accepted by the machine and
other words are not, and that whether or not a word is accepted
depends on the circle or "state" you are in when you have reached
the end of your word.
Recognize that there are patterns in the words that are
accepted by the machine.
Depending on the age and experience of the students, teachers may also want
to note the extent to which students are able to:
Predict whether a word will be accepted or not.
Devise words that will be accepted.
Articulate the strategies that they used to devise words that
will be accepted.
Predict whether a word will be accepted by looking at the machine
but not walking through it.
Predict whether a word will be accepted by looking at the
notation for words that will be accepted.
Articulate the patterns that they discovered in words that were
and were not accepted.
Understand the notation for generalizing which words are
accepted.
Use the notation for generalizing which words are
accepted.
Draw conclusions, make predictions, generate questions about
finite state machines and follow up on them.
