Decidability and Shortest Strings in Formal Languages
Levent Alpoge, Thomas Ang, Luke Schaeffer, Jeffrey Shallit
TL;DR
This paper investigates the decidability of nonemptiness for formal languages and establishes bounds on the shortest string length when the language is nonempty.
Contribution
It provides new results on the decidability of language nonemptiness and bounds on shortest string lengths across different language specifications.
Findings
Decidability results for nonemptiness in various language representations.
Upper and lower bounds on shortest string lengths in nonempty languages.
Applicable to multiple formal language classes.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Natural Language Processing Techniques · Algorithms and Data Compression