Decidability and Shortest Strings in Formal Languages

  • Levent Alpoge
  • Thomas Ang
  • Luke Schaeffer
  • Jeffrey Shallit
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6808)

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)MATHGoogle Scholar
  2. 2.
    Alpoge, L.: Post correspondence problem variant. Posted to (January 12, 2011), http://cstheory.stackexchange.com/questions/4284/post-correspondence-problem-variant
  3. 3.
    Ang, T.: Problems related to shortest strings in formal languages. M. Math. thesis. University of Waterloo (2010)Google Scholar
  4. 4.
    Baker, B.S., Book, R.V.: Reversal-bounded multipushdown machines. J. Comput. System Sci. 8, 315–332 (1974)CrossRefMATHMathSciNetGoogle Scholar
  5. 5.
    Ellul, K., Krawetz, B., Shallit, J., Wang, M.-W.: Regular expressions: new results and open problems. J. Autom. Lang. Combin. 10, 407–437 (2005)MATHGoogle Scholar
  6. 6.
    Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)MATHGoogle Scholar
  7. 7.
    Pighizzini, G., Shallit, J.: Unary language operations, state complexity, and Jacobsthal’s function. Int. J. Found. Comput. Sci. 13, 145–159 (2002)CrossRefMATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Levent Alpoge
    • 1
  • Thomas Ang
    • 2
  • Luke Schaeffer
    • 2
  • Jeffrey Shallit
    • 2
  1. 1.Harvard CollegeCambridgeUSA
  2. 2.School of Computer ScienceUniversity of WaterlooWaterlooCanada

Personalised recommendations