Decidability and Shortest Strings in Formal Languages

@inproceedings{Alpoge2011DecidabilityAS,
  title={Decidability and Shortest Strings in Formal Languages},
  author={Levent Alpoge and Thomas Ang and Luke Schaeffer and Jeffrey Shallit},
  booktitle={DCFS},
  year={2011}
}
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.