Decidability and Shortest Strings in Formal Languages
  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. 
Levent Alpoge, Thomas Ang, Luke Schaeffer, Jeffrey Shallit
cs.FL