L is a finite set of characters called the input alphabet .
F is a subset of K and is called the set of final or accepting states . So far, all the automata we have seen are deterministic, that is, they have the property that there is no ambiguity in state transitions. Simulating a deterministic automaton is easy - every step is determined. We can write a program to act like our automaton. The current state is kept in the variable CurrentState.