In automata theory, a finite-state machine is called a deterministic finite automaton, if each of its transitions is uniquely determined by its source state and input symbol, and reading an input symbol is required for each state transition. Wikipedia