2011 | OriginalPaper | Chapter
Decidability and Shortest Strings in Formal Languages
Authors : Levent Alpoge, Thomas Ang, Luke Schaeffer, Jeffrey Shallit
Published in: Descriptional Complexity of Formal Systems
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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
.