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.
Unable to display preview. Download preview PDF.
- 2.Alpoge, L.: Post correspondence problem variant. Posted to (January 12, 2011), http://cstheory.stackexchange.com/questions/4284/post-correspondence-problem-variant
- 3.Ang, T.: Problems related to shortest strings in formal languages. M. Math. thesis. University of Waterloo (2010)Google Scholar