End of the Chapter

You have reached the end this chapter. You may wish to review the following. Click on a subject that interests you to make a state transition to the page that discusses it.

• Definition of a string of characters.
• The state of an automaton.
• A transition between states.
• The final state.
• How a string is recognized.
• The language accepted by an automaton.
• What happens when an automaton is stuck.
• Regular expressions and regular languages.
• Form of a Java identifier.
• epsilon-transitions.
• Non-deterministic automaton.
• Deterministic automaton.