Decidability and Shortest Strings in Formal Languages
classification
💻 cs.FL
keywords
formalnonemptyshortestboundsconsiderdecidabilitydeterminingfind
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.