0 votes 0 votes Show that if $L$ is a nonempty language such that any $w$ in $L$ has length at least $n$, then any dfa accepting $L$ must have at least $n + 1$ states. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation finite-automata + – Naveen Kumar 3 asked Mar 30, 2019 Naveen Kumar 3 476 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.