  Given a formal language L specified in various ways, we consider the problem
of determining if L is nonempty. If L is indeed nonempty, we find upper and
lower bounds on the length of the shortest string in L.
