In computer science, a deterministic automaton is a concept of automata theory where the outcome of a transition from one state to another is determined by the input. Wikipedia