Dead state of a finite automaton
= Dead state of a finite automaton
A <dead state of a finite automaton> has no path to an accepting state. In a complete <deterministic finite automaton>, all dead states may be merged into one rejecting sink without changing the accepted <formal language>.