Accessible state of a deterministic finite automaton

A state is accessible when some input word takes the initial state to it. Removing inaccessible states preserves the accepted language.