Programminga DFA
Previous slide
Next slide
Back to first slide
View graphic version
We need the FSM structure:
a finite set of states
a set of transitions (edges)
a start state
a set of accepting (final) states
We need the DFA criteria:
given a particular state and an input character, the next state is unique
We code it