Finite State Machinesand DFA
FSM:
- a finite set of states
- a set of transitions (edges)
- a start state
- a set of final states
Deterministic Finite Automata
- all outgoing edges are labelled with an input character
- no two edges leaving a given state have the same label
- Therefore: the next state can be determined uniquely, given the current state and the current input character