[Overview] [Previous] [Next]
Deterministic Finite Acceptors
A DFA is drawn as a graph, with each state
represented by a circle.
- Deterministic--there is no element of choice
- Finite--only a finite number of states and arcs
- Acceptors--produce only a yes/no answer
One designated state is the start state.
Some states (possibly including the start state)
can be designated as final states.
Arcs between states represent state transitions
-- each such arc is labeled with the symbol that
triggers the transition.
Copyright © 1996 by David Matuszek
Last modified Jan 29, 1996