Decidability and Shortest Strings in Formal Languages

  • Levent Alpoge
  • Thomas Ang
  • Luke Schaeffer
  • Jeffrey Shallit
Conference paper

DOI: 10.1007/978-3-642-22600-7_5

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6808)
Cite this paper as:
Alpoge L., Ang T., Schaeffer L., Shallit J. (2011) Decidability and Shortest Strings in Formal Languages. In: Holzer M., Kutrib M., Pighizzini G. (eds) Descriptional Complexity of Formal Systems. DCFS 2011. Lecture Notes in Computer Science, vol 6808. Springer, Berlin, Heidelberg

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.

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