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.
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 . But none of that matters because we only need AN accepting path. We can show all the possible state transition paths for an input string in a tree-like diagram where every possible transition is shown at each step. We can build a deterministic automaton that will accept the same strings as our nondeterministic automaton. Our deterministic automaton has fewer states but more edges and more complicated labeling.