Skip to main content
Conference Proceedings

Decidability and shortest strings in formal languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2011) 6808 LNCS 55-67
DOI: 10.1007/978-3-642-22600-7_5
5Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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. © 2011 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Alpoge, L., Ang, T., Schaeffer, L., & Shallit, J. (2011). Decidability and shortest strings in formal languages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6808 LNCS, pp. 55–67). https://doi.org/10.1007/978-3-642-22600-7_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free