Deterministic Finite Automaton - Graph View A finite-state machine in which each state has exactly one transition per input symbol, with no ambiguity and no epsilon moves. View concept details Related ConceptsFinite-State Machine State Machine Turing Machine Statechart ← Back to full graph